The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1

In this paper, we disprove the following conjecture due to Goemans (1997) and Linial (2002): "Every negative type metric embeds into with constant distortion." We show that for every /spl delta/ > 0, and for large enough n, there is an n-point negative type metric which requires distortion at-least (log log n) /sup 1/6-/spl delta// to embed into l/sub 1/. Surprisingly, our construction is inspired by the Unique Games Conjecture (UGC) of Khot (2002), establishing a previously unsuspected connection between PCPs and the theory of metric embeddings. We first prove that the UGC implies super-constant hardness results for (non-uniform) sparsest cut and minimum uncut problems. It is already known that the UGC also implies an optimal hardness result for maximum cut (2004). Though these hardness results depend on the UGC, the integrality gap instances rely "only" on the PCP reductions for the respective problems. Towards this, we first construct an integrality gap instance for a natural SDP relaxation of unique games. Then, we "simulate" the PCP reduction and "translate"the integrality gap instance of unique games to integrality gap instances for the respective cut problems! This enables us to prove a (log log n) /sup 1/6-/spl delta// integrality gap for (nonuniform) sparsest cut and minimum uncut, and an optimal integrality gap for maximum cut. All our SDP solutions satisfy the so-called "triangle inequality" constraints. This also shows, for the first time, that the triangle inequality constraints do not add any power to the Goemans-Williamson's SDP relaxation of maximum cut. The integrality gap for sparsest cut immediately implies a lower bound for embedding negative type metrics into l/sub i/. It also disproves the non-uniform version of Arora, Rao and Vazirani's Conjecture (2004), asserting that the integrality gap of the sparsest cut SDP, with the triangle inequality constraints, is bounded from above by a constant.

[1]  P. Enflo.  On the nonexistence of uniform homeomorphisms betweenLp-spaces , 1970 .

[2]  J. Bourgain.  On lipschitz embedding of finite metric spaces in Hilbert space , 1985 .

[3]  László Lovász,et al.  Two-prover one-round proof systems: their power and their problems (extended abstract) , 1992, STOC '92.

[4]  Nathan Linial,et al.  The geometry of graphs and some of its algorithmic applications , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

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

[6]  Michel Deza,et al.  Geometry of cuts and metrics , 2009, Algorithms and combinatorics.

[7]  Michel X. Goemans,et al.  Semideenite Programming in Combinatorial Optimization , 1999 .

[8]  Yuval Rabani,et al.  An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm , 1998, SIAM J. Comput..

[9]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

[10]  Uriel Feige,et al.  On the optimality of the random hyperplane rounding technique for MAX CUT , 2002, Random Struct. Algorithms.

[11]  Nathan Linial.  Finite metric spaces: combinatorics, geometry and algorithms , 2002, SCG '02.

[12]  Jiri Matousek,et al.  Lectures on discrete geometry , 2002, Graduate texts in mathematics.

[13]  J. Bourgain.  On the distribution of the fourier spectrum of Boolean functions , 2002 .

[14]  Subhash Khot.  On the power of unique 2-prover 1-round games , 2002, STOC '02.

[15]  I. Bárány.  LECTURES ON DISCRETE GEOMETRY (Graduate Texts in Mathematics 212) , 2003 .

[16]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[17]  Guy Kindler,et al.  Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[18]  Satish Rao,et al.  Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.

[19]  Amit Agarwal,et al.  O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems , 2005, STOC '05.

[20]  A. Sinclair,et al.  Quasisymmetric embeddings, the observable diameter, and expansion properties of graphs , 2005 .

[21]  Subhash Khot,et al.  Nonembeddability theorems via Fourier analysis , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[22]  James R. Lee,et al.  Improved approximation algorithms for minimum-weight vertex separators , 2005, STOC '05.

[23]  Guy Kindler,et al.  On non-approximability for quadratic programs , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[24]  Anupam Gupta,et al.  Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut , 2005, SODA '05.

[25]  Yuval Rabani,et al.  On the Hardness of Approximating Multicut and Sparsest-Cut , 2005, Computational Complexity Conference.

[26]  James R. Lee,et al.  Euclidean distortion and the sparsest cut , 2005, STOC '05.

[27]  Sanjeev Arora,et al.  Local versus global properties of metric spaces , 2006, SODA 2006.

[28]  Nisheeth K. Vishnoi,et al.  Integrality gaps for sparsest cut and minimum linear arrangement problems , 2006, STOC '06.