How good is the goemans-williamson MAX CUT algorithm?

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 427-434

  Karloff, Howard ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR CONSTRAINTS; MAX CUT; PERFORMANCE RATIO; SEMI-DEFINITE PROGRAMMING;

COMPUTATION THEORY; ALGORITHMS;

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; GRAPH THEORY; MATHEMATICAL PROGRAMMING; OPTIMIZATION; PERFORMANCE;

PERFORMANCE RATIO; SEMIDEFINITE PROGRAMMING;

EID: 0029719649     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.237990     Document Type: Conference Paper

References (6)

1. F. Barahona and A. R. Mahjoub, "On the Cut Polytope", Mathematical Programming 36(1986), 157-173.
2. P. Delsarte, "Hahn Polynomials, Discrete Harmonics, and t-Designs", SIAM Journal on Applied Math 34(1978), 157-166.
3. U. Feige and M. X. Goemans, "Approximating the Value of Two Prover Proof Systems, With Applications to MAX 2SAT and MAX DI-CUT", Proc. Third Israel Symposium on Theory of Computing and Systems, Israel, 1995.
4. M. X. Goemans and D. P. Williamson, "Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming", to appear in Journal of the Association for Computing Machinery. A preliminary version of this paper appeared in Proc. 26th ACM Symposium on the Theory of Computing (1994), Montréal, 422-431.
5. D. Karger, R. Motwani, and M. Sudan, "Approximate Graph Coloring by Semidefinite Programming", Proc. 35th ACM Symposium on the Foundations of Computer Science (1994), Santa Fe, 2-13.
6. D. Knuth, "Combinatorial Matrices", notes of Institut Mittag-Leffler, Nov., 1991, revised Jan., 1993.