Abstract
Several combinatorial optimization problems can be approximated using algorithms based on semidefinite programming. In many of these algorithms a semidefinite relaxation of the underlying problem is solved yielding an optimal vector configuration v 1...v n. This vector configuration is then rounded into a 0,1 solution. We present a procedure called RPR 2 (Random Projection followed by Randomized Rounding) for rounding the solution of such semidefinite programs. We show that the random hyperplane rounding technique introduced by Goemans and Williamson, and its variant that involves outward rotation are both special cases of RPR 2. We illustrate the use of RPR 2 by presenting two applications. For Max-Bisection we improve the approximation ratio. For Max-Cut, we improve the tradeoff curve (presented by Zwick) that relates the approximation ratio to the size of the maximum cut in a graph.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
U. Feige and M.X. Goemans. Approximating the value of two prover proof systems with applications to Max-2-Sat and Max-Dicut. Proc. of the 3rd Israel Symposium on Theory of Computing and Systems, pages 182–189, 1995.
A. 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. ECCC, TR00-021, 2000.
U. Feige and M. Langberg. The RPR 2 rounding technique for semidefinite programs. Manuscript, http://www.wisdom.weizmann.ac.il/~mikel, 2001.
U. Feige and G. Schechtman. On the optimality of the random hyperplane rounding technique for MAX CUT. Manuscript, 2001.
M.X. Goemans and D.P. Williamson. New 3/4-approximation algorithms for the maximum satisfiability problem. SIAM Journal on Discrete Mathematics, 7(4):656–666, 1994.
M.X. Goemans and D.P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of ACM, 42:1115–1145, 1995.
D.S. Hochbaum. Approximation algorithms for the set covering and vertex cover problem. SIAM J. of Computing, 11(3):555–556, 1982.
E. Halperin and U. Zwick. Improved approximation algorithms for maximum graph bisection problems. Manuscript, 2000.
D. Karger, R. Motwani, and M. Sudan. Approximate graph coloring by semidefinite programming. Journal of ACM, 45(2):246–265, 1998.
H. Karloff and U. Zwick. A 7/8-approximation algorithm for Max-3-Sat? In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, pages 406–415, 1997.
Y. E. Nesterov. Semidefinite relaxation and nonconvex quadratic optimization. Optimization Methods and Software, 9:141–160, 1998.
A. Renyi. Probability theory. Elsevier, New York, 1970.
P. Raghavan and C.D. Thompson. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 7(7):365–374, 1987.
Y. Ye. A 0.699-approximation algorithm for Max-Bisection. Manuscript, available at URL http://dollar.biz.uiowa.edu/col/ye/, 1999.
U. Zwick. Outward rotations: a new tool for rounding solutions of semidefinite programming relaxations, with application to Max-Cut and other problems. In Proceedings of the 31th ACM Symposium on Theory of Computing, pages 679–687, 1999.
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
Feige, U., Langberg, M. (2001). The RPR 2 Rounding Technique for Semidefinite Programs. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 2001. Lecture Notes in Computer Science, vol 2076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48224-5_18
Download citation
DOI: https://doi.org/10.1007/3-540-48224-5_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42287-7
Online ISBN: 978-3-540-48224-6
eBook Packages: Springer Book Archive