A 7/6-approximation algorithm for the max-min connected bipartition problem on grid graphs

Authors:
Bang Ye Wu
Affiliations:
National Chung Cheng University, ChiaYi, Taiwan, R.O.C.
Venue:
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
Year:
2010

Citing 4
Cited 0

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Approximating the maximally balanced connected partition problem in graphs

Information Processing Letters
Max-Min Tree Partitioning

Journal of the ACM (JACM)
Lowest common ancestors in trees and directed acyclic graphs

Journal of Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.