Towards a Better Approximation for Sparsest Cut?

We give a new (1 + ε)-approximation for SPARSEST CUT problem on graphs where small sets expand significantly more than the sparsest cut (expansion of sets of size n/r exceeds that of the sparsest cut by a factor √log n log r, for some small r; this condition holds for many natural graph families). We give two different algorithms. One involves Guruswami-Sinop rounding on the level-r Lasserre relaxation. The other is combinatorial and involves a new notion called Small Set Expander Flows (inspired by the expander flows of [1]) which we show exists in the input graph. Both algorithms run in time 2O(r)poly(n). We also show similar approximation algorithms in graphs with genus g with an analogous local expansion condition. This is the first algorithm we know of that achieves (1 + ε)-approximation on such general family of graphs.

[1]  Noga Alon,et al.  lambda1, Isoperimetric inequalities for graphs, and superconcentrators , 1985, J. Comb. Theory, Ser. B.

[2]  Jonah Sherman,et al.  Breaking the Multicommodity Flow Barrier for O(vlog n)-Approximations to Sparsest Cut , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[3]  Yuan Zhou,et al.  Approximability and proof complexity , 2012, SODA.

[4]  Sanjeev Arora,et al.  Subexponential Algorithms for Unique Games and Related Problems , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[5]  Luis Rademacher,et al.  Efficient Volume Sampling for Row/Column Subset Selection , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[6]  Sanjeev Arora,et al.  A combinatorial, primal-dual approach to semidefinite programs , 2007, STOC '07.

[7]  Prasad Raghavendra,et al.  Many sparse cuts via higher eigenvalues , 2011, STOC '12.

[8]  Kunal Talwar,et al.  An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor , 2003, RANDOM-APPROX.

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

[10]  James R. Lee,et al.  Near-optimal distortion bounds for embedding doubling spaces into L1 , 2011, STOC '11.

[11]  Kevin J. Lang,et al.  An algorithm for improving graph partitions , 2008, SODA '08.

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

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

[14]  Aravindan Vijayaraghavan,et al.  Approximation algorithms for semi-random partitioning problems , 2012, STOC '12.

[15]  James R. Lee,et al.  Genus and the geometry of the cut graph , 2010, SODA '10.

[16]  Prasad Raghavendra,et al.  Rounding Semidefinite Programming Hierarchies via Global Correlation , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[17]  Konstantin Makarychev,et al.  How to Play Unique Games Using Embeddings , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[18]  Pablo A. Parrilo,et al.  Semidefinite programming relaxations for semialgebraic problems , 2003, Math. Program..

[19]  Cynthia A. Phillips,et al.  Finding minimum-quotient cuts in planar graphs , 1993, STOC.

[20]  Venkatesan Guruswami,et al.  Optimal column-based low-rank matrix reconstruction , 2011, SODA.

[21]  Venkatesan Guruswami,et al.  Faster SDP Hierarchy Solvers for Local Rounding Algorithms , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[22]  Robert Krauthgamer,et al.  Min-max Graph Partitioning and Small Set Expansion , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[23]  Prasad Raghavendra,et al.  Graph expansion and the unique games conjecture , 2010, STOC '10.

[24]  Jean B. Lasserre,et al.  An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs , 2002, SIAM J. Optim..

[25]  Yuan Zhou,et al.  Hypercontractivity, sum-of-squares proofs, and their applications , 2012, STOC '12.

[26]  Elad Hazan,et al.  O(/spl radic/log n) approximation to SPARSEST CUT in O/spl tilde/(n/sup 2/) time , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[27]  Luca Trevisan,et al.  Improved ARV Rounding in Small-set Expanders and Graphs of Bounded Threshold Rank , 2013, ArXiv.

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

[29]  A. Naor,et al.  Euclidean quotients of finite metric spaces , 2004, math/0406349.

[30]  Venkatesan Guruswami,et al.  Approximating Non-Uniform Sparsest Cut Via Generalized Spectra , 2013, SODA.

[31]  Venkatesan Guruswami,et al.  Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.