Abstract
We obtain improved semidefinite programming based ap- proximation algorithms for all the natural maximum bisection problems of graphs. Among the problems considered are: MAX n/2-BISECTION - partition the vertices of a graph into two sets of equal size such that the total weight of edges connecting vertices from different sides is maximized; MAX n/2-VERTEX-COVER - find a set containing half of the vertices such that the total weight of edges touching this set is maximized; MAX n/2-DENSE-SUBGRAPH - find a set containing half of the vertices such that the total weight of edges connecting two vertices from this set is maximized; and MAX n/2-UnCUT - partition the vertices into two sets of equal size such that the total weight of edges that do not cross the cut is maximized. We also consider the directed versions of these problems, MAX n/2-DIRECTED-BISECTION and MAX n/2-DIRECTED-UnCUT. These results can be used to obtain improved approximation algorithms for the unbalanced versions of the partition problems mentioned above, where we want to partition the graph into two sets of size k and n - k, where k is not necessarily n/2. Our results improve, extend and unify results of Frieze and Jerrum, Feige and Langberg, Ye, and others.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. Ageev, R. Hassin, and M. Sviridenko. An 0.5-approximation algorithm for MAX DICUT with given sizes of parts. Manuscript, 2000.
U. Feige and M.X. Goemans. Approximating the value of two prover proof systems, with applications to MAX-2SAT and MAX-DICUT. In Proceedings of the 3nd Israel Symposium on Theory and Computing Systems, Tel Aviv, Israel, pages 182–189, 1995.
A.M. Frieze and M. Jerrum. Improved approximation algorithms for MAX k-CUT and MAX BISECTION. Algorithmica, 18:67–81, 1997.
U. Feige, M. Karpinski, and M. Langberg. Improved approximation of Max-Cut on graphs of bounded degree. Technical report, E-CCC Report number TR00-043, 2000.
U. Feige, M. Karpinski, and M. Langberg. A note on approximating MAX-BISECTION on regular graphs. Technical report, E-CCC Report number TR00-043, 2000.
U. Feige and M. Langberg. Approximation algorithms for maximization problems arising in graph partitioning. Manuscript, 1999.
U. Feige and G. Schechtman. On the integrality ratio of semidefinite relaxations of MAX CUT. In Proceedings of the 33th Annual ACM Symposium on Theory of Computing, Crete, Greece, 2001. To appear.
M. Grötschel, L. Lovász, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1:169–197, 1981.
M.X. Goemans and D.P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42:1115–1145, 1995.
Q. Han, Y. Ye, and J. Zhang. An improved rounding method and semidefinite programming relaxation for graph partition. Manuscript, 2000.
Q. Han, Y. Ye, H. Zhang, and J. Zhang. On approximation of Max-Vertex-Cover. Manuscript, 2000.
Y. E. Nesterov. Semidefinite relaxation and nonconvex quadratic optimization. Optimization Methods and Software, 9:141–160, 1998.
P. Turán. On an extremal problem in graph theory. Mat. Fiz. Lapok, 48:436–452, 1941.
H. Wolkowicz, R. Saigal, and L. Vandenberghe, editors. Handbook of semidefinite programming. Kluwer, 2000.
Y. Ye. A 0.699-approximation algorithm for Max-Bisection. Manuscript, 1999.
Y. Ye and J. Zhang. Approximation of dense-n/2-subgraph and the complement of min-bisection. Manuscript, 1999.
U. Zwick. Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to max cut and other problems. In Proceedings of the 31th Annual ACM Symposium on Theory of Computing, Atlanta, Georgia, pages 679–687, 1999.
U. Zwick. Analyzing the MAX 2-SAT and MAX DI-CUT approximation algorithms of Feige and Goemans. Manuscript, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Halperin, E., Zwick, U. (2001). A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems. In: Aardal, K., Gerards, B. (eds) Integer Programming and Combinatorial Optimization. IPCO 2001. Lecture Notes in Computer Science, vol 2081. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45535-3_17
Download citation
DOI: https://doi.org/10.1007/3-540-45535-3_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42225-9
Online ISBN: 978-3-540-45535-6
eBook Packages: Springer Book Archive