Improved approximation algorithms for maximum graph partitioning problems

Journal of Combinatorial Optimization

Volumn 10, Issue 2, 2005, Pages 133-167

  Jäger, Gerold ^a   Srivastav, Anand ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

Approximation factor; Maximum graph partitioning; Semidefinite programming

Indexed keywords

APPROXIMATION THEORY; COMPUTER AIDED ANALYSIS; GRAPH THEORY; LINEAR PROGRAMMING; PROBLEM SOLVING; RANDOM PROCESSES;

APPROXIMATION FACTOR; MAXIMUM GRAPH PARTITIONING; SEMIDEFINITE PROGRAMMING; SUB-OPTIMAL CHOICES;

ALGORITHMS;

EID: 24144436226     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10878-005-2269-7     Document Type: Article

References (17)

1. A. Ageev, R. Hassin, and M. Sviridenko, "A 0.5-approximation algorithm for MAX DICUT with given sizes of parts," SIAM Journal on Discrete Mathematics, vol. 14, no. 2, pp. 246-255, 2001.
2. A. Ageev and M. Sviridenko, "Approximation algorithms for maximum coverage and max cut with given size of parts," in Proceedings of Integer Programming and Combinatorial Optimization, 1999, pp. 17-30.
3. Y. Asahiro, K. Iwama, H. Tamaki, and T. Tokuyama, "Greedily finding a dense subgraph," Journal of Algorithms, vol. 34, pp. 203-221, 2000.
4. D. Bertsimas and Y. Ye, Semidefinite Relaxations, Multivariate Normal Distributions, and Order Statistics, Handbook of Combinatorial Optimization, vol. 3, Kluwer Academic Publishers, 1998, pp. 1-19.
5. A. Frieze and M. Jerrum, "Improved approximation algorithms for MAX k-CUT and MAX Bisection," Algorithmica, vol. 18, pp. 67-81, 1997.
6. U. Feige and M. Langberg, "Approximation algorithms for maximization problems arising in graph partitioning," Journal of Algorithms, vol. 41, pp. 174-211, 2001.
7. 2 rounding technique for semidefinite programs," in Proceedings of the 33th Annual ACM Symposium on Theory of Computing, Crete, Greece, 2001, pp. 213-224.
8. U. Feige, G. Kortsarz, and D. Peleg, "The dense k-subgraph problem," Algorithmica, vol. 29, pp. 410-421, 2001.
9. U. Feige and M. Seltser, "On the densest k-subgraph problem," Technical report, Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehovot, September 1997.
10. M.X. Goemans and D.P. Williamson, "Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming," Journal of the ACM, vol. 42, pp. 1115-1145, 1995.
11. E. Halperin and U. Zwick, "A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems," Random Structures and Algorithms, vol. 20, no. 3, pp. 382-402, 2002.
12. Q. Han, Y. Ye, and J. Zhang, "An improved rounding method and semidefinite programming relaxation for graph partition," Mathematical Programming, vol. 92, no. 3, pp. 509-535, 2002.
13. A. Srivastav and K. Wolf, "Finding dense subgraphs with semidefinite programming," in Proceedings of Approximation Algorithms for Combinatorial Optimization, 1998, pp. 181-191.
14. A. Srivastav and K. Wolf, "Finding dense subgraphs with semidefinite programming," Erratum, Mathematisches Seminar, Universität zu Kiel, 1999.
15. P. Turán, "On an extremal problem in graph theory," Mat. Fiz. Lapok, vol. 48, pp. 436-452, 1941.
16. Y. Ye, "A.699-approximation algorithm for MAX-Bisection," Mathematical Programming, vol. 90, no. 1, pp. 101-111, 2001.
17. Y. Ye and J. Zhang, "Approximation of dense-n/2-subgraph and the complement of Min-Bisection," Unpublished Manuscript, 1999.