Constructing worst case instances for semidefinite programming based approximation algorithms

SIAM Journal on Discrete Mathematics

Volumn 15, Issue 1, 2001, Pages 58-72

  Alon, Noga ^a   Sudakov, Benny ^b,c   Zwick, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b PRINCETON UNIVERSITY   (United States)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Approximation algorithm; MAX CUT; Semidefinite programming

Indexed keywords

GRAPH THEORY; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBABILITY; PROBLEM SOLVING; SET THEORY; VECTORS;

APPROXIMATION ALGORITHM; MAX CUT PROBLEM; SEMIDEFINITE PROGRAMMING;

ALGORITHMS;

EID: 10844234989     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480100379713     Document Type: Article

References (15)

1. [AKMR96] N. ALON, P. KELSEN, S. MAHAGAN, AND H. RAMESH, Approximate hypergraph coloring, Nordic J. Comput., 3 (1996), pp. 425-439.
2. [AS00] N. ALON AND B. SUDAKOV, Bipartite subgraphs and the smallest eigenvalue, Combin. Probab. Comput., 9 (2000), pp. 1-12.
3. [CHLL97] G. COHEN, I HONKALA, S. LITSYN, AND A LOBSTEIN, Covering Codes, North-Holland, Amsterdam, 1997.
4. [FG95] U. FEIGE AND M.X. GOEMANS, Approximating the value of two prover proof systems, with applications to MAX-2SAT and MAX-DICUT, in Proceedings of the 3rd Israel Symposium on Theory and Computing Systems, Tel Aviv, Israel, 1995, pp. 182-189.
5. [FKS89] J. FRIEDMAN, J. KAHN, AND E. SZEMERÉDI, On the second eigenvalue in random regular graphs, in Proceedings of the 21st Annual ACM Symposium on Theory of Computing, Seattle, WA, 1989, pp. 587-598.
6. [Fri91] J. FRIEDMAN, On the second eigenvalue and random walks in random d-regular graphs, Combinatorica, 11 (1991), pp. 331-362.
7. [GW95] 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.
8. [Hås97] J. HASTAD, Some optimal inapproximability results, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, TX, 1997, pp. 1-10.
9. [Kar99] H. KARLOFF, How good is the Goemans-Williamson MAX CUT algorithm? SIAM J. Comput., 29 (1999), pp. 336-350.
10. [KZ97] H. KARLOFF AND U. ZWICK, A 7/8-approximation algorithm for MAX 3SAT?, in Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, Miami Beach, FL, 1997, pp 406-415.
11. [Lov93] L. LOVÁSZ, Combinatorial Problems and Exercises. North-Holland, Amsterdam. 1993.
12. [TSSW96] L. TREVISAN, G.B. SORKIN, M. SUDAN, AND D.P. WILLIAMSON, Gadgets, approximation, and linear programming (extended abstract), in Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, Burlington, VT, 1996, pp. 617-626.
13. [Zwi98] U. ZWICK, Approximation algorithms for constraint satisfaction problems, involving at most three variables per constraint, in Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 1998, ACM, New York, 1998, pp. 201-210.
14. [Zwi99] U. ZWICK, Outward rotations: A tool for rounding solutions of semidefinite programming relaxations, with applications to max cut and other problems, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing, Atlanta, GA, 1999, pp. 679-687.
15. [Zwi00] U. ZWICK, Analyzing the MAX 2-SAT and MAX DI-CUT approximation algorithms of Feige and Goemans, submitted.