Constructing worst case instances for semidefinite programming based approximation algorithms

Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain performance guarantees using local ratio techniques. Are the bounds obtained in this way tight? This problem was considered before by Karloff and by Alon and Sudakov. Here we further extend their results and show, for the first time, that the local analyses of the Goemans and Williamson MAX CUT algorithm, as well as its extension by Zwick, are tight for every possible relative size of the maximum cut. We also obtain similar results for several related problems. Our approach is quite general and could possibly be applied to some additional problems and algorithms.

[1]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[2]  Endre Szemerédi,et al.  On the second eigenvalue of random regular graphs , 1989, STOC '89.

[3]  Howard J. Karloff,et al.  How good is the Goemans-Williamson MAX CUT algorithm? , 1996, STOC '96.

[4]  Joel Friedman,et al.  On the second eigenvalue and random walks in randomd-regular graphs , 1991, Comb..

[5]  Uri Zwick,et al.  Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint , 1998, SODA '98.

[6]  Noga Alon,et al.  Approximate Hypergraph Coloring , 1996, Nord. J. Comput..

[7]  Noga Alon,et al.  Bipartite Subgraphs and the Smallest Eigenvalue , 2000, Combinatorics, Probability and Computing.

[8]  U. Zwick.  Analyzing the MAX 2-SAT and MAX DI-CUT approximation algorithms of Feige and Goemans , 2000 .

[9]  L. Lovász.  Combinatorial problems and exercises , 1979 .

[10]  Uri Zwick,et al.  A 7/8-approximation algorithm for MAX 3SAT? , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[11]  Uriel Feige,et al.  Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[12]  Uri Zwick,et al.  Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems , 1999, STOC '99.

[13]  Luca Trevisan,et al.  Gadgets, Approximation, and Linear Programming (extended abstract). , 1996, IEEE Annual Symposium on Foundations of Computer Science.

[14]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.