Expander flows, geometric embeddings and graph partitioning

We give a O(√log n)-approximation algorithm for sparsest cut, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leighton and Rao (1988). We use a well-known semidefinite relaxation with triangle inequality constraints. Central to our analysis is a geometric theorem about projections of point sets in Rd, whose proof makes essential use of a phenomenon called measure concentration. We also describe an interesting and natural "certificate" for a graph's expansion, by embedding an n-node expander in it with appropriate dilation and congestion. We call this an expander flow.

[1]  C. McDiarmid.  Concentration , 1862, The Dental register.

[2]  L. Danzer,et al.  Über zwei Probleme bezüglich konvexer Körper von P. Erdös und von V. L. Klee , 1962 .

[3]  M. Murty.  Ramanujan Graphs , 1965 .

[4]  J. Cheeger.  A lower bound for the smallest eigenvalue of the Laplacian , 1969 .

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

[6]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[7]  Oliver Vornberger,et al.  The Complexity of Testing Whether a Graph is a Superconcentrator , 1981, Inf. Process. Lett..

[8]  N. Alon,et al.  il , , lsoperimetric Inequalities for Graphs , and Superconcentrators , 1985 .

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

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

[11]  N. Alon.  Eigenvalues and expanders , 1986, Comb..

[12]  Mark Jerrum,et al.  Approximating the Permanent , 1989, SIAM J. Comput..

[13]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[14]  Warren P. Adams,et al.  A hierarchy of relaxation between the continuous and convex hull representations , 1990 .

[15]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..

[16]  Farhad Shahrokhi,et al.  The maximum concurrent flow problem , 1990, JACM.

[17]  Éva Tardos,et al.  Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[18]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[19]  Alistair Sinclair,et al.  Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow , 1992, Combinatorics, Probability and Computing.

[20]  P. Diaconis,et al.  COMPARISON THEOREMS FOR REVERSIBLE MARKOV CHAINS , 1993 .

[21]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

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

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

[24]  Farid Alizadeh,et al.  Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization , 1995, SIAM J. Optim..

[25]  David B. Shmoys,et al.  Cut problems and their application to divide-and-conquer , 1996 .

[26]  Mihalis Yannakakis,et al.  Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications , 1996, SIAM J. Comput..

[27]  Michel X. Goemans,et al.  Semidefinite programming in combinatorial optimization , 1997, Math. Program..

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

[29]  K. Ball.  An elementary introduction to modern convex geometry, in flavors of geometry , 1997 .

[30]  K. Ball.  An Elementary Introduction to Modern Convex Geometry , 1997 .

[31]  David R. Karger,et al.  Approximate graph coloring by semidefinite programming , 1998, JACM.

[32]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[33]  M. Goemans.  Semidefinite programming and combinatorial optimization , 1998 .

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

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

[36]  Fang Chen,et al.  Lifting Markov chains to speed up mixing , 1999, STOC '99.

[37]  David P. Williamson,et al.  Improved approximation algorithms for MAX SAT , 2000, SODA '00.

[38]  Robert Krauthgamer,et al.  A polylogarithmic approximation of the minimum bisection , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

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

[40]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[41]  Imre Brny.  LECTURES ON DISCRETE GEOMETRY (Graduate Texts in Mathematics 212) By JI MATOUEK: 481 pp., 31.50 (US$39.95), ISBN 0-387-95374-4 (Springer, New York, 2002). , 2003 .

[42]  G. Schechtman.  Chapter 37 - Concentration, Results and Applications , 2003 .

[43]  Satish Rao,et al.  A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts , 2004, IPCO.

[44]  Sanjeev Arora,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.

[45]  Elad Hazan,et al.  O(√log n) approximation to SPARSEST CUT in Õ(n 2) time , 2004, IEEE Annual Symposium on Foundations of Computer Science.

[46]  Robert Krauthgamer,et al.  Measured descent: a new embedding method for finite metrics , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[47]  James R. Lee,et al.  On distance scales, embeddings, and efficient relaxations of the cut cone , 2005, SODA '05.

[48]  George Karakostas.  A Better Approximation Ratio for the Vertex Cover Problem , 2005, ICALP.

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

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

[51]  Nisheeth K. Vishnoi,et al.  The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1 , 2005, FOCS.

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

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

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

[55]  Dan Suciu,et al.  Journal of the ACM , 2006 .

[56]  Satish Rao,et al.  Graph partitioning using single commodity flows , 2006, STOC '06.

[57]  Yuval Rabani,et al.  Improved lower bounds for embeddings into L1 , 2009, SODA '06.

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

[59]  Mohammad Taghi Hajiaghayi,et al.  L22 Spreading Metrics for Vertex Ordering Problems , 2006, SODA.