Max-min weight balanced connected partition
From MaRDI portal
Publication:386475
DOI10.1007/s10898-012-0028-8zbMath1282.90222OpenAlexW2094004331MaRDI QIDQ386475
Weili Wu, Lele Wang, Zhao Zhang, Lidan Fan, Di Wu
Publication date: 9 December 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-0028-8
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (2)
Approximation algorithms for maximally balanced connected graph partition ⋮ Approximation algorithms for the maximally balanced connected graph tripartition problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear-time algorithm for four-partitioning four-connected planar graphs
- Approximating the Maximally Balanced Connected Partition Problem in graphs
- A linear algorithm for bipartition of biconnected graphs
- On the complexity of partitioning graphs into connected subgraphs
- Trapezoid graphs and their coloring
- An \(O(k^ 2 n^ 2)\) algorithm to find a \(k\)-partition in a \(k\)- connected graph
- On the approximability of some Maximum Spanning Tree Problems
- Clustering on trees
- Most uniform path partitioning and its use in image processing
- On the structure of trapezoid graphs
- An efficient algorithm to solve connectivity problem on trapezoid graphs
- FULLY POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR THE MAX–MIN CONNECTED PARTITION PROBLEM ON INTERVAL GRAPHS
- An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs
- Max-Min Tree Partitioning
- Nonseparating cycles inK-Connected graphs
- Uncontractable 4-connected graphs
- A homology theory for spanning tress of a graph
- Max-min partitioning of grid graphs into connected components
- A polynomial-time algorithm for max-min partitioning of ladders
This page was built for publication: Max-min weight balanced connected partition
