Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation

Science in China, Series A: Mathematics

Volumn 50, Issue 11, 2007, Pages 1583-1596

  Xu, Da Chuan ^a   Zhang, Shu Zhong ^b  

^a BEIJING UNIVERSITY OF TECHNOLOGY   (China)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Approximation algorithm; Max cut problem; Performance ratio; Quadratic maximization; Semidefinite programming relaxation

Indexed keywords

EID: 35448933276     PISSN: 10069283     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11425-007-0080-x     Document Type: Article

References (27)

1. Goemans M X, Williamson D P. Improved approximation algorithms for Maximum Cut and Satisfiability problems using semidefinite programming. J ACM, 42: 1115-1145 (1995)
2. Alon N, Sudakov B, Zwick, U. Constructing worst case instances for semidefinite programming based approximation algorithms. SIAM J Discrete Math, 15: 58-72 (2002)
3. Zwick U. Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, 679-687
4. Alon N, Sudakov B. Bipartite subgraphs and the smallest eigenvalue. Combin, Probab and Comput, 9: 1-12 (2000)
5. Feige U, Schechtman G. On the optimality of the random hyperplane rounding technique for MAX CUT. Random Structures and Algorithms, 20(3): 403-440 (2002)
6. Karloff H. How good is the Goemans-Williamson MAX CUT algorithm? SIAM J Comput, 29: 336-350 (1999)
7. Khot S, Kindler G, Mossel E, O'Donnell R. Optimal inapproximability results for MAX-CUT and other two-variable CSPs? In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, 2004, 146-154
8. Håstad J. Some optimal inapproximability results. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 1997, 1-10
9. Bertsimas D, Ye Y. Semidefinite relaxation, multivariate normal distributions, and other statistics. In: Du, D-Z, Pardalos P M, eds. Handbook of Combinatorial Optimization 3. Kluwer Academic Publishers, 1998, 1-19
10. Goemans M X. Semidefinite programming in combinatorial optimization. Math Programming, 79: 143-161 (1997)
11. Han Q, Ye Y, Zhang J. An improved rounding method and semidefinite programming relaxation for graph partition. Math Programming, 92: 509-535 (2002)
12. Helmberg C. Semidefinite programming for combinatorial optimization. ZIB-Report 00-34, 2000
13. Lovász L. Semidefinite programs and combinatorial optimization. Technical Report. Redmond, WA 98052: Microsoft Research, 2000
14. Rendl F. Semidefinite programming and combinatorial optimization. Technical Report. Austria: Universität Klagenfurt, Institut für Mathematik, 1998
15. Xu D, Ye Y, Zhang J. Approximating the 2-catalog segmentation problem using semidefinite programming relaxation. Optim Method and Softw, 18: 705-719 (2003)
16. Nemirovski A, Roos C, Terlaky T. On the maximization of quadratic form over intersection of ellipsoids with common center. Math Programming, 86: 463-474 (1999)
17. Nesterov Yu. Semidefinite relaxation and nonconvex quadratic optimization. Optim Methods and Softw, 9: 141-160 (1998)
18. Nesterov Yu. Global quadratic optimization via conic relaxation. CORE Discussion Paper. Belgium: Louvain-la-Neuve, 1998
19. Tseng P. Further Results approximating nonconvex quadratic optimization by semidefinite programming relaxation. SIAM J Optim, 2003, 14: 268-283 (2003)
20. Ye Y. Approximating quadratic programming with bound and quadratic constraints. Math Programming, 84: 219-226 (1999)
21. Ye Y. Approximating global quadratic optimization with convex quadratic constraints. J Global Optim, 15: 1-17 (1999)
22. Zhang S. Quadratic maximization and semidefinite relaxation. Math Programming, 87: 453-465 (2000)
23. Sturm J F, Zhang S. On cones of nonnegative quadratic functions. Math Oper Res, 28: 246-267 (2003)
24. Ye Y, Zhang S. New results on quadratic minimization. SIAM J Optim, 14: 245-267 (2003)
25. Kim S, Kojima M. Exact solutions of some nonconvex quadartic optimization problems via SDP and SOCP relaxations. Working Papepr. Todyo: Department of Mathematical and Information Sciences, The Tokyo Institute of Technology, 2001
26. 2 rounding technique for semidefinite programs. In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming. Greece: Crete, 2001, 213-224
27. Feige U, Karpinski M, Langberg M. Improved approximation of max-cut on graphs of bounded degree. J Algorithms, 43: 201-219 (2002)