Approximation Algorithms for Maximization Problems Arising in Graph Partitioning

Journal of Algorithms

Volumn 41, Issue 2, 2001, Pages 174-211

  Feige, Uriel ^a   Langberg, Michael ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000801925     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2001.1183     Document Type: Article

References (33)

1. T. Asano, Approximation algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson, in "Proceedings of the 5th IEEE Israel Symposium on Theory of Computing and Systems, 1997," pp. 24-37.
2. Y. Asahiro, K. Iwama, H. Tamaki, and T. Tokuyama, Greedily finding a dense subgraph, in "Proceedings of the 5th Scandinavian Workshop on Algorithm Theory (SWAT)," Lecture Notes in Computer Science, Vol. 1097, pp. 136-148, Springer-Verlag, Berlin/New York, 1996.
3. A. A. Ageev and M. I. Sviridenko, Approximation algorithms for maximum coverage and max cut with given sizes of parts, in "Proceedings of the Conference on Integer Programming and Combinatorial Optimization (IPCO99)," Lecture Notes in Computer Science, Vol. 1610, pp. 17-30, Springer-Verlag, Berlin/New York, 1999.
4. U. Feige, A threshold of Inn for approximating set cover, J. ACM 45(4) (1998), 634-652.
5. U. Feige and M. X. Goemans, Approximating the value of two prover proof systems with applications to Max-2-SAT and Max-Dicut, in "Proceedings of the 3rd IEEE Israel Symposium on Theory of Computing and Systems, 1995," pp. 182-189.
6. A. Frieze and M. Jerrum, Improved approximation algorithms for Max-k-Cut and Max-Bisection, Algorithmica 18 (1997), 67-81.
7. U. Feige, G. Kortsarz, and D. Peleg, The dense k-subgraph problem, Algorithmica 29(3) (2001), 410-421.
8. 2 rounding technique for semidefinite programs, in "Proceedings of ICALP, 2001," pp. 213-224.
9. U. Feige and M. Seltser, "On the Densest k-Subgraph Problem," Technical Report CS97-16, Weizmann Institute of Science.
10. M. R. Garey and D. S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness," Bell Telephone Laboratories, 1979.
11. M. R. Garey, D. S. Johnson, and L. Stockmeyer, Some simplified NP-complete graph problems, Theoret. Comput. Sci. 1 (1976), 237-267.
12. G. H. Golub and C. F. Van Loan, "Matrix Computation," The Johns Hopkins Press, Baltimore, 1983.
13. M. X. Goemans and D. P. Williamson, New 3/4-approximation algorithms for the maximum satisfiability problem, SIAM J. Discrete Math. 7(4) (1994), 656-666.
14. M. X. Goemans and D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM 42 (1995), 1115-1145.
15. J. Håstad, Some optimal inapproximability results, in "Proceedings of the 28th Annual ACM Symposium on Theory of Computing, El Paso, Texas, 1997," pp. 1-10.
16. D. S. Hochbaum, "Approximation Algorithms for NP-Hard Problems," PWS, Boston, 1995.
17. T. Hagerup and C. Rub, A guided tour of chernoff bounds, Inform. Process. lett. 33(6) (1990), 305-308.
18. E. Halperin and U. Zwick, A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems, in "IPCO 2001," pp. 210-225.
19. N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica 4 (1984), 373-395.
20. L. G. Khachiyan, A polynomial algorithm for linear programming, Dokl. Akad. Nauk USSR 244 (1997). [In Russian.] Translation: Soviet Math. Dokl. 20 (1979), 191-194.
21. L. G. Khachiyan, A polynomial algorithm for linear programming, Dokl. Akad. Nauk USSR 244 (1997). [In Russian.] Translation: Soviet Math. Dokl. 20 (1979), 191-194.
22. G. Kortsarz and D. Peleg, On choosing a dense subgraph, in "Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, 1993," pp. 692-701.
23. B. Karloff and U. Zwick, A (7/8 - ε)-approximation algorithm for Max-3-SAT? in "Proceedings of the 38th IEEE Symposium on Foundations of Computer Science, 1997," pp. 406-415.
24. M. Langberg, "Approximation Algorithms for Maximization Problems Arising in Graph Partitioning," M.Sc. thesis, Weizmann Institute of Science, 1998.
25. G. L. Nemhauser and W. T. Trotter, Vertex packing: Structural properties and algorithms, Math. Programming 8 (1975), 232-248.
26. E. Petrank, The hardness of approximation: Gap location, Comput. Complexity 4 (1994), 133-157.
27. C. H. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, J. Comput. System Sci. 43 (1991), 425-440.
28. P. Raghavan and C. D. Thompson, Randomized rounding: A technique for provably good algorithms and algorithmic proofs, Combinatorica 7(4) (1987), 365-374.
29. M. I. Sviridenko, Best possible approximation algorithms for Max-SAT with cardinality constraint, in "Proceedings of International Workshop Approx. '98," pp. 193-199.
30. A. Srivastav and K. Wolf, Finding dense subgraphs with semidefinite programming, in "Proceedings of International Workshop Approx. '98," pp. 181-191. Erratum: A. Srivastav and K. Wolf, "Erratum on Finding Dense Subgraphs with Semidefinite Programming," Preprint, Mathematisches Seminar, Universitaet zu Kiel, 1999.
31. M. Yannakakis, On the approximation of maximum satisfiability, J. Algorithms 17 (1994), 475-502.
32. Y. Ye, "A 0.699-Approximation Algorithm for Max-Bisection," Manuscript, 1999.
33. U. Zwick, Outward rotations: A new tool for rounding solutions of semidefinite programming relaxations, with application to Max-Cut and other problems, in "Proceedings of the 31th ACM Symposium on Theory of Computing, 1999," pp. 679-687.