Improved approximation algorithms for maximum graph partitioning problems extended abstract

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

Volumn 3328, Issue , 2004, Pages 348-359

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

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; LINEAR PROGRAMMING; APPROXIMATION ALGORITHMS; GRAPH THEORY; SOFTWARE ENGINEERING;

ALGORITHMICS; APPROXIMATION FACTOR; CHOICE OF PARAMETERS; EXTENDED ABSTRACTS; GRAPH PARTITIONING PROBLEMS; HARD WORK; MATHEMATICAL OPTIMIZATION PROBLEMS; MAXIMUM GRAPH PARTITIONING; PARAMETER-DRIVEN; SEMI-DEFINITE PROGRAMMING; OPTIMAL SOLUTIONS; SEMIDEFINITE RELAXATION; SYSTEMATIC ANALYSIS;

APPROXIMATION ALGORITHMS; OPTIMIZATION;

EID: 35048892105     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30538-5_29     Document Type: Article

References (16)

1. A. Ageev, R. Hassin, M. Sviridenko, A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts, SIAM Journal on Discrete Mathematics 14 (2), p. 246-255, 2001.
2. A. Ageev, M. Sviridenko, Approximation Algorithms for Maximum Coverage and Max Cut with Given Size of Parts, IPCO '99, p. 17-30, 1999.
3. Y. Asahiro, K. Iwama, H. Tamaki, T. Tokuyama, Greedily Finding a Dense Subgraph, Journal of Algorithms 34, p. 203-221, 2000.
4. D. Bertsimas, Y. Ye, Semidefinite Relaxations, Multivariate Normal Distributions, and Order Statistics, Handbook of Combinatorial Optimization (Vol. 3), Kluwer Academic Publishers, p. 1-19, 1998.
5. U. Feige, M. Langberg, Approximation Algorithms for Maximization Problems arising in Graph Partitioning, Journal of Algorithms 41, p. 174-211, 2001.
6. 2 rounding technique for semidefinite programs, Proceedings of the 33th Annual ACM Symposium on Theory of Computing, Crete, Greece, p. 213-224, 2001.
7. U. Feige, G. Kortsarz, D. Peleg, The Dense k-Subgraph Problem, Algorithmica 29, p. 410-421, 2001.
8. U. Feige, M. Seltser, On the densest k-subgraph problem, Technical report, Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehovot, September 1997.
9. A. Frieze, M. Jerrum, Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION, Algorithmica 18, p. 67-81, 1997.
10. M.X. Goemans, D.P. Williamson, Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming, Journal of the ACM, 42, p. 1115-1145, 1995.
11. E. Halperin, U. Zwick, A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems, Random Structures and Algorithms 20 (3), p. 382-402, 2002.
12. Q. Han, Y. Ye, J. Zhang, An Improved Rounding Method and Semidefinite Programming Relaxation for Graph Partition, Mathematical Programming 92 (3), p. 509-535, 2002.
13. S. Mahajan, H. Ramesh, Derandomizing approximation algorithms based on semidefinite programming, SIAM Journal on Computing 28, p. 1641-1663, 1999.
14. A. Srivastav, K. Wolf, Finding Dense Subgraphs with Semidefinite Programming, Approximation Algorithms for Combinatorial Optimization '98, p. 181-191, 1998. (Erratum, Mathematisches Seminar, Universität zu Kiel, 1999.)
15. Y. Ye, A .699-approximation algorithm for MAX-Bisection, Mathematical Programming 90 (1), p. 101-111, 2001.
16. Y. Ye, J. Zhang, Approximation of Dense-n/2-Subgraph and the complement of Min-Bisection, Unpublished Manuscript, 1999.