On the complexity of graph tree partition problems

This paper concerns the optimal partition of a graph into p connected clusters of vertices, with various constraints on their topology and weight. We consider different objectives, depending on the cost of the trees spanning the clusters. This rich family of problems mainly applies to telecommunication network design, but it can be useful in other fields. We achieve a complete characterization of its computational complexity, previously studied only for special cases: a polynomial algorithm based on a new matroid solves the easy cases; the others are strongly NP-hard by direct reduction from SAT. Finally, we give results on special graphs.

[1]  J. Gower,et al.  Minimum Spanning Trees and Single Linkage Cluster Analysis , 1969 .

[2]  Agha Iqbal Ali,et al.  Balanced spanning forests and trees , 1991, Networks.

[3]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[4]  Takeo Yamada,et al.  A branch-and-bound algorithm for the mini-max spanning forest problem , 1997 .

[5]  David S. Johnson,et al.  The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.

[6]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[7]  W. Ackermann.  Zum Hilbertschen Aufbau der reellen Zahlen , 1928 .

[8]  David P. Williamson,et al.  A general approximation technique for constrained forest problems , 1992, SODA '92.

[9]  B. Gavish,et al.  Heuristics with Constant Error Guarantees for the Design of Tree Networks , 1988 .

[10]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  Leonid Khachiyan,et al.  A greedy heuristic for a minimum-weight forest problem , 1993, Oper. Res. Lett..

[13]  Refael Hassin,et al.  Approximation Algorithms for Min-Max Tree Partition , 1997, J. Algorithms.

[14]  James G. Oxley,et al.  Matroid theory , 1992 .

[15]  Takeo Yamada,et al.  A heuristic algorithm for the mini-max spanning forest problem☆ , 1996 .

[16]  Christos H. Papadimitriou,et al.  The complexity of the capacitated tree problem , 1978, Networks.

[17]  Refael Hassin,et al.  Approximation Algorithms for Minimum Tree Partition , 1998, Discret. Appl. Math..

[18]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.