The RPR2 rounding technique for semidefinite programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2076 LNCS, Issue , 2001, Pages 213-224

  Feige, Uriel ^a   Langberg, Michael ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMBINATORIAL OPTIMIZATION; ALGORITHMS; COMPUTATIONAL LINGUISTICS;

APPROXIMATION RATIOS; COMBINATORIAL OPTIMIZATION PROBLEMS; RANDOM PROJECTIONS; RANDOMIZED ROUNDING; SEMI-DEFINITE PROGRAMMING; SEMIDEFINITE PROGRAMS; SEMIDEFINITE RELAXATION; TRADE-OFF CURVES;

SUPPORT VECTOR MACHINES; OPTIMIZATION;

EID: 84879539747     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_18     Document Type: Conference Paper

References (16)

1. 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.
2. A. Frieze and M. Jerrum. Improved approximation algorithms for Max-k-Cut and Max-Bisection. Algorithmica, 18:67-81, 1997.
3. U. Feige, M. Karpinski, and M. Langberg. Improved approximation of Max-Cut on graphs of bounded degree. ECCC, TR00-021, 2000.
4. U. Feige and M. Langberg. The RP R2 rounding technique for semidefinite programs. Manuscript, http://www. wisdom. weizmann. ac. il/mikel, 2001.
5. U. Feige and G. Schechtman. On the optimality of the random hyperplane rounding technique for MAX CUT. Manuscript, 2001.
6. 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.
7. 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.
8. D. S. Hochbaum. Approximation algorithms for the set covering and vertex cover problem. SIAM J. of Computing, 11(3):555-556, 1982.
9. E. Halperin and U. Zwick. Improved approximation algorithms for maximum graph bisection problems. Manuscript, 2000.
10. D. Karger, R. Motwani, and M. Sudan. Approximate graph coloring by semidefinite programming. Journal of ACM, 45(2):246-265, 1998.
11. 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.
12. Y. E. Nesterov. Semidefinite relaxation and nonconvex quadratic optimization. Optimization Methods and Software, 9:141-160, 1998.
13. A. Renyi. Probability theory. Elsevier, New York, 1970.
14. P. Raghavan and C. D. Thompson. Randomized rounding : A technique for provably good algorithms and algorithmic proofs. Combinatorica, 7(7):365-374, 1987.
15. Y. Ye. A 0. 699-approximation algorithm for Max-Bisection. Manuscript, available at URL http://dollar. biz. uiowa. edu/col/ye/, 1999.
16. U. Zwick. Outward rotations: a new tool for rounding solutions of semidefi-nite 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.