How good is the Goemans-Williamson MAX CUT algorithm?

SIAM Journal on Computing

Volumn 29, Issue 1, 1999, Pages 336-350

  Karloff, Howard ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; MATHEMATICAL PROGRAMMING;

GOEMANS-WILLIAMSON MAX CUT ALGORITHMS; SEMIDEFINITE PROGRAMMING;

ALGORITHMS;

EID: 0343168152     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539797321481     Document Type: Article

References (8)

1. F. BARAHONA AND A. R. MAHJOUB, On the cut polytope, Math. Programming, 36 (1986), pp. 157-173.
2. P. DELSARTE, Hahn polynomials, discrete harmonics, and t-designs, SIAM J. Appl. Math., 34 (1978), pp. 157-166.
3. M. M. DEZA AND M. LAURENT, Geometry of Cuts and Metrics, Springer-Verlag, New York, 1997.
4. U. FEIGE AND M. X. GOEMANS, Approximating the value of two-prover proof systems, with applications to MAX 2SAT and MAX DICUT, in Proceedings, Third Israel Symposium on the Theory of Computing and Systems, Tel-Aviv, Israel, 1995.
5. M. X. GOEMANS AND D. P. WILLIAMSON, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM, 42 (1995), pp. 1115-1145.
6. D. KARGER, R. MOTWANI, AND M. SUDAN, Approximate graph coloring by semidefinite programming, in Proceedings 35th ACM Symposium on the Foundations of Computer Science, 1994, Santa Fe, NM, pp. 2-13.
7. H. KARLOFF, How good is the Goemans-Williamson MAX CUT algorithm?, in Proceedings 28th ACM Symposium on the Theory of Computing, 1996, Philadelphia, pp. 427-434.
8. D. KNUTH, Combinatorial Matrices, Notes, Institut Mittag-Leffler, 1991, revised 1993.