论文信息 - A 7/6-Approximation Algorithm for the Max-Min Connected Bipartition Problem on Grid Graphs

A 7/6-Approximation Algorithm for the Max-Min Connected Bipartition Problem on Grid Graphs

For a given graph with nonnegative weights on nodes, the max-min connected bipartition problem looks for a way to partition the graph into two connected subgraphs such that the minimum weight of the two subgraphs is maximized. In this paper, we give a polynomial time 7/6-approximation algorithm for grid graphs. The approximation ratio is currently the best result achieved in polynomial time.

Bang Ye Wu | B. Wu

[1] Robert E. Tarjan,et al. Computing an st -Numbering , 1976, Theor. Comput. Sci..

[2] Janka Chlebíková,et al. Approximating the Maximally Balanced Connected Partition Problem in Graphs , 1996, Inf. Process. Lett..

[3] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[4] Ronald I. Becker,et al. A Polynomial-Time Algorithm for Max-Min Partitioning of Ladders , 2001, Theory of Computing Systems.

[5] L. Lovász. A homology theory for spanning tress of a graph , 1977 .

[6] Ronald I. Becker,et al. Max-min partitioning of grid graphs into connected components , 1998 .

[7] Alasdair Urquhart,et al. Formal Languages]: Mathematical Logic--mechanical theorem proving , 2022 .

[8] Stephen R. Schach,et al. Max-Min Tree Partitioning , 1981, JACM.

[9] Yoshiko Wakabayashi,et al. Approximation and Inapproximability Results on Balanced Connected Partitions of Graphs , 2007, Discret. Math. Theor. Comput. Sci..

[10] D. West. Introduction to Graph Theory , 1995 .

[11] Steven Skiena,et al. Lowest common ancestors in trees and directed acyclic graphs , 2005, J. Algorithms.