MAX-CUT has a randomized approximation scheme in dense graphs

Random Structures and Algorithms

Volumn 8, Issue 3, 1996, Pages 187-198

  Fernandez de la Vega, W ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030136319     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199605)8:3<187::AID-RSA3>3.0.CO;2-U     Document Type: Article

References (14)

1. N. Alon and J.H. Spencer, The Probabilistic Method, Wiley, 1992.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and hardness of approximation problems, Proc. 33rd FOCS, IEEE, IEEE Computer Society Press, November 1994, pp. 24-35.
3. S. Arora, D. Karger, and M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, Proc. 27th STOC, ACM Press, June 1995, pp. 284-293. Invited paper for the special issue "STOC'95" of the Journal of Computer and Systems Sciences.
4. F. Barahona and A.R. Madhjoub, On the cut polytope, Math. Program., 36, 157-173 (1986).
5. C. Delorme and S. Poljak, Combinatorial properties and the complexity of a Max-Cut approximation, Eur. J. Combinat., 14, 313-333 (1993).
6. C. Delorme and S. Poljak, Laplacian eigenvalues and the maximum cut problem, Math. Program., 62, 557-574 (1993).
7. M. Deza and M. Laurent, A survey of the known facets of the cut cone, Report 91722-OR Institute für Okonometrie und Operations Research, Bonn, 1992.
8. M. Deza and M. Laurent, Applications of cut polyhedra, Report BS-R9221, CWI, Amsterdam, 1992.
9. M. X. Goemans and D. P. Williamson, .878-Approximation algorithms for MAX-CUT and MAX-2SAT, in Proc. 26th STOC, ACM Press, May 1994, pp. 422-431.
10. M. X. Goemans and D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM, to appear.
11. M. Grotschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988, Chap. 8.
12. C. H. Papadimitriou and M. Yannakakis, Optimization, approximation and complexity classes, J. Comput. Systm. Sci., 43, 425-440 (1991).
13. S. Poljak and F. Rendl, Solving the Max-Cut problem using eigenvalues, Report 91735-OR, Institut für Diskrete Mathematik, University of Bonn, 1991.
14. S. Sahni and T. Gonzalez, P-complete approximation problems, J. ACM, 23, 555-565 (1976).