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...

Full description

Saved in:
Bibliographic Details
Published inComputational Geometry, Graphs and Applications Vol. 7033; pp. 188 - 194
Main Author Wu, Bang Ye
Format Book Chapter
LanguageEnglish
Published Germany Springer Berlin / Heidelberg 2011
Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Subjects
algorithm
Algorithms & data structures
approximation algorithm
connected partition
Discrete mathematics
Graphics programming
grid graph
non-separating path
Online AccessGet full text
ISBN9783642249822
3642249825
ISSN0302-9743
1611-3349
DOI10.1007/978-3-642-24983-9_19

Cover

More Information
Summary: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.
ISBN:9783642249822
3642249825
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-642-24983-9_19