Balanced connected partitions of graphs: approximation, parameterization and lower bounds

Cites Work

Which problems have strongly exponential complexity?
Integer Programming with a Fixed Number of Variables
Minkowski's Convex Body Theorem and Integer Programming
On the complexity of $k$-SAT
Most uniform path partitioning and its use in image processing
Title not available (Why is that?)
Approximating the Maximally Balanced Connected Partition Problem in graphs
On the complexity of partitioning graphs into connected subgraphs
A linear-time algorithm for four-partitioning four-connected planar graphs
Title not available (Why is that?)
Title not available (Why is that?)
A homology theory for spanning tress of a graph
A linear algorithm for bipartition of biconnected graphs
An application of simultaneous diophantine approximation in combinatorial optimization
Graph Layout Problems Parameterized by Vertex Cover
Clustering on trees
Fully polynomial-time approximation schemes for the max-min connected partition problem on interval graphs
Max-Min Tree Partitioning
Max-min partitioning of grid graphs into connected components
A polynomial-time algorithm for max-min partitioning of ladders
A Shifting Algorithm for Min-Max Tree Partitioning
What makes equitable connected partition easy
Approximation algorithms for maximally balanced connected graph partition
Approximation and parameterized algorithms for balanced connected partition problems
Shifting algorithms for tree partitioning with general weighting functions
Approximation algorithms for the maximally balanced connected graph tripartition problem
Partitioning a graph into balanced connected classes: formulations, separation and experiments
Cut and flow formulations for the balanced connected $k$-partition problem
Title not available (Why is that?)

Cited In (7)

LOCALLY-BALANCED $k$-PARTITIONS OF GRAPHS
Complexity and inapproximability results for balanced connected subgraph problem
Approximation algorithm for the balanced 2-connected $k$-partition problem
On the parameterized complexity of computing balanced partitions in graphs
Approximation algorithms for maximally balanced connected graph partition
Approximation and parameterized algorithms for balanced connected partition problems
Title not available (Why is that?)

This page was built for publication: Balanced connected partitions of graphs: approximation, parameterization and lower bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166191)