An improved rounding method and semidefinite programming relaxation for graph partition

Mathematical Programming, Series B

Volumn 92, Issue 3, 2002, Pages 509-535

  Han, Qiaoming ^a,c   Ye, Yinyu ^b   Zhang, Jiawei ^b  

^a NANJING NORMAL UNIVERSITY   (China)

^b UNIVERSITY OF IOWA   (United States)

^c UNIVERSITY OF IOWA   (United States)

Author keywords

Dense k Subgraph Max Cut Max Not Cut Max Vertex Cover polynomial approximation algorithm; Performance ratio; Semidefinite programming

Indexed keywords

ALGEBRA; ALGORITHMS; COMPUTER SOFTWARE; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; INTEGERS; PERFORMANCE RATIO; PROGRAMMING RELAXATION; SEMIDEFINITE PROGRAMMING;

GRAPH THEORY;

EID: 0005369530     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070100288     Document Type: Article

References (21)

1. Ageev, A.A., Sviridenko, M.I. (1999): Approximation algorithms for maximum coverage and max cut with given sizes of parts. IPCO, Cornuejols, G., Burkard, R.E., Woeginger, G.J., eds., pp. 17-30
2. Andersson, G. (1999): An approximation algorithm for max p-section. Proceedings of 16th International Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 1563, 237-247. Springer, Berlin
3. Asahiro, Y., Iwama, K., Tamaki, H., Tokuyama, T. (1996): Greedily finding a dense subgraph. In: Proceedings of the 5th Scandinavian Workshop on Algorithm Theory (SWAT), Lecture Notes in Computers Science 1097, 136-148. Springer
4. Bertsimas, D., Ye, Y. (1998): Semidefinite relaxations, multivariate normal distributions, and order statistics. Handbook of Combinatorial Optimization (Vol. 3), Du, D.-Z., Pardalos, P.M., eds., pp. 1-19. Kluwer Academic Publishers
5. Feige, U., Goemans, M.X. (1995): Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT. In: Proceedings of the Third Israel Symposium on Theory of Computing and Systems, pp 182-189
6. Feige, U., Langberg, M.: Approximation algorithms for maximization problems arising in graph partitioning. To appear in J. Algorithms
7. Feige, U., Seltser, M. (1997): On the densest k-subgraph problem. Technical report, Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehovot, September 1997
8. Feige, U., Kortsarz, G., Peleg, D. (2001): The dense k-subgraph problem. Algorithmica 29, 410-421
9. Frieze, A., Jerrum, M. (1997): Improved approximation algorithms for max k-cut and max bisection. Algorithmica 18, 67-81
10. Goemans, M.X., Williamson, D.P. (1995): Improved approximation algorithms for Maximum Cut and Satisfiability problems using semidefinite programming. Journal of the ACM 42, 1115-1145
11. Han, Q., Ye, Y., Zhang, H., Zhang, J. (2000): On approximation of Max-Vertex-Cover. Conference Paper presented at EUROXVII, Budapest, July 2000
12. Kortsarz, G., Peleg, D. (1993): On choosing a dense subgraph. In: 34th FOCS, pp. 692-701
13. Mahajan, S., Ramesh, H. (1995): Derandomizing semidefinite programming based approximation algorithms. In: 36th FOCS, pp. 162-169
14. Nesterov, Y.E. (1998): Semidefinite relaxation and nonconvex quadratic optimization. Optimization Methods and Software 9, 141-160
15. Petrank, E. (1994): The hardness of approximation: gap location. Computational Complexity 4, 133-157
16. Srivastav, A., Wolf, K. (1998): Finding dense subgraphs with semidefinite programming. In: Approximation Algorithms for Combinatorial Optimization. Jansen, K., Rolim, J., eds., pp. 181-191
17. Ye, Y. (2001): A. 699-approximation algorithm for Max-Bisection. Math. Program. 90, 101-111
18. Ye, Y. (1999): Approximating quadratic programming with bound and quadratic constraints. Math. Program. 84, 219-226
19. Ye, Y., Zhang, J. (1999): Approximation of Dense-n/2-Subgraph and the complement of Min-Bisection. Unpublished Manuscript, December 1999
20. Zwick, U. (1998): Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint. In: 9th SODA, pp. 201-210
21. Zwick, U. (1999): Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to Max-Cut and other problems. In: 31th STOC, pp. 679-687