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.
Keywordsalgorithm approximation algorithm non-separating path connected partition grid graph
Unable to display preview. Download preview PDF.