A (log n)Ω(1) integrality gap for the sparsest cut SDP

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2009, Pages 555-564

  Cheeger, Jeff ^a   Kleiner, Bruce ^a   Naor, Assaf ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

Heisenberg group; Integrality gap; Metric embeddings; Semidefinite programming; Sparsest cut problem

Indexed keywords

HEISENBERG GROUP; INTEGRALITY GAPS; LIPSCHITZ; METRIC SPACES; QUANTITATIVE BOUNDS; SEMI-DEFINITE PROGRAMMING; SEMIDEFINITE RELAXATION; SPARSEST CUT;

COMPUTER SCIENCE; FIBER OPTIC CHEMICAL SENSORS; TOPOLOGY;

MATHEMATICAL PROGRAMMING;

EID: 77952362220     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2009.47     Document Type: Conference Paper

References (40)

1. A. Agrawal, P. Klein, R. Ravi, and S. Rao, "Approximation through multicommodity flow," in 31st Annual Symposium on Foundations of Computer Science. IEEE Computer Soc., Los Alamitos, CA, 1990, pp. 726-737.
2. L. Ambrosio, N. Fusco, and D. Pallara, Functions of bounded variation and free discontinuity problems, ser. Oxford Mathematical Monographs. New York: The Clarendon Press Oxford University Press, 2000.
3. S. Arora, J. R. Lee, and A. Naor, "Euclidean distortion and the sparsest cut," J. Amer. Math. Soc., vol. 21, no. 1, pp. 1-21 (electronic), 2008.
4. S. Arora, S. Rao, and U. Vazirani, "Expander flows, geometric embeddings and graph partitioning," in Proceedings of the 36th Annual ACM Symposium on Theory of Computing. New York: ACM, 2004, pp. 222-231 (electronic).
5. n," Bull. Soc. Math. France, vol. 111, no. 4, pp. 429-448, 1983.
6. Y. Aumann and Y. Rabani, "An O(log k) approximate min-cut max-flow theorem and approximation algorithm," SIAM J. Comput., vol. 27, no. 1, pp. 291-301 (electronic), 1998.
7. J. Bourgain, "On Lipschitz embedding of finite metric spaces in Hilbert space," Israel J. Math., vol. 52, no. 1-2, pp. 46-52, 1985.
8. S. Brendle and R. Schoen, "Manifolds with 1/4-pinched curvature are space forms," J. Amer. Math. Soc., vol. 22, no. 1, pp. 287-307, 2009.
9. L. Capogna, D. Danielli, and N. Garofalo, "The geometric Sobolev embedding for vector fields and the isoperimetric inequality," Comm. Anal. Geom., vol. 2, no. 2, pp. 203-215, 1994.
10. S. Chawla, "Sparsest cut," in Encyclopedia of Algorithms, M.-Y. Kao, Ed. Springer, 2008.
11. S. Chawla, A. Gupta, and H. Räcke, "Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut," ACM Trans. Algorithms, vol. 4, no. 2, pp. Art. 22, 18, 2008.
12. S. Chawla, R. Krauthgamer, R. Kumar, Y. Rabani, and D. Sivakumar, "On the hardness of approximating multicut and sparsest-cut," Comput. Complexity, vol. 15, no. 2, pp. 94-114, 2006.
13. J. Cheeger and T. Colding, "Lower bounds on Ricci curvature and the almost rigidity of warped products," Ann. of Math. (2), vol. 144, no. 1, pp. 189-237, 1996.
14. 1 and the geometry of BV functions," 2006, preprint available at http://arxiv.org/abs/math/0611954. To appear in Ann. Math.
15. 1," 2008, preprint available at http://arxiv.org/abs/0907.3295.
16. 1," preprint, 2009.
17. J. Chuzhoy and S. Khanna, "Polynomial flow-cut gaps and hardness of directed cut problems [extended abstract]," in STOC'07 - Proceedings of the 39th Annual ACM Symposium on Theory of Computing. New York: ACM, 2007, pp. 179-188.
18. N. R. Devanur, S. A. Khot, R. Saket, and N. K. Vishnoi, "Integrality gaps for sparsest cut and minimum linear arrangement problems," in STOC'06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing. New York: ACM, 2006, pp. 537-546.
19. M. M. Deza and M. Laurent, Geometry of cuts and metrics, ser. Algorithms and Combinatorics. Berlin: Springer-Verlag, 1997, vol. 15.
20. B. Franchi, R. Serapioni, and F. Serra Cassano, "Rectifiability and perimeter in the Heisenberg group," Math. Ann., vol. 321, no. 3, pp. 479-531, 2001. (Pubitemid 33725815)
21. -, "On the structure of finite perimeter sets in step 2 Carnot groups," J. Geom. Anal., vol. 13, no. 3, pp. 421-466, 2003.
22. N. Fusco, F. Maggi, and A. Pratelli, "The sharp quantitative isoperimetric inequality," Ann. of Math. (2), vol. 168, no. 3, pp. 941-980, 2008.
23. M. X. Goemans, "Semidefinite programming in combinatorial optimization," Math. Programming, vol. 79, no. 1-3, Ser. B, pp. 143-161, 1997, lectures on mathematical programming (ismp97) (Lausanne, 1997).
24. S. Khot, "On the power of unique 2-prover 1-round games," in Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing. New York: ACM, 2002, pp. 767-775 (electronic). (Pubitemid 35009440)
25. 1" in Proceedings of the 46th Annual IEEE Conference on Foundations of Computer Science, 2005, pp. 53-62.
26. R. Krauthgamer, J. R. Lee, M. Mendel, and A. Naor, "Measured descent: a new embedding method for finite metrics," Geom. Funct. Anal., vol. 15, no. 4, pp. 839-858, 2005.
27. R. Krauthgamer and Y. Rabani, "Improved lower bounds for embeddings into L1," in Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms. New York: ACM, 2006, pp. 1010-1017.
28. J. R. Lee and A. Naor, "Extending Lipschitz functions via random metric partitions," Invent. Math., vol. 160, no. 1, pp. 59-95, 2005.
29. p metrics on the Heisenberg group and the Goemans-Linial conjecture," in FOCS. IEEE Computer Society, 2006, pp. 99-108.
30. J. R. Lee and P. Raghavendra, "Coarse differentiation and multi-flows in planar graphs," in APPROX-RANDOM, ser. Lecture Notes in Computer Science, M. Charikar, K. Jansen, O. Reingold, and J. D. P. Rolim, Eds., vol. 4627. Springer, 2007, pp. 228-241.
31. T. Leighton and S. Rao, "Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms," J. ACM, vol. 46, no. 6, pp. 787-832, 1999.
32. N. Linial, "Finite metric-spaces - combinatorics, geometry and algorithms," in Proceedings of the International Congress of Mathematicians, Vol. III (Beijing, 2002). Beijing: Higher Ed. Press, 2002, pp. 573-586.
33. N. Linial, E. London, and Y. Rabinovich, "The geometry of graphs and some of its algorithmic applications," Combina-torica, vol. 15, no. 2, pp. 215-245, 1995.
34. J. Matoušek, Lectures on discrete geometry, ser. Graduate Texts in Mathematics. New York: Springer-Verlag, 2002, vol. 212.
35. F. Montefalcone, "Some relations among volume, intrinsic perimeter and one-dimensional restrictions of BV functions in Carnot groups," Ann. Sc. Norm. Super. Pisa Cl. Sci. (5), vol. 4, no. 1, pp. 79-128, 2005.
36. R. Montgomery, A tour of subriemannian geometries, their geodesics and applications, ser. Mathematical Surveys and Monographs. Providence, RI: American Mathematical Society, 2002, vol. 91.
37. A. Naor and G. Schechtman, "Planar earthmover is not in L1," SIAM J. Comput., vol. 37, no. 3, pp. 804-826 (electronic), 2007.
38. Y. Rabinovich, "On average distortion of embedding metrics into the line," Discrete Comput. Geom., vol. 39, no. 4, pp. 720-733, 2008.
39. F. Shahrokhi and D. W. Matula, "The maximum concurrent flow problem," J. Assoc. Comput. Mach., vol. 37, no. 2, pp. 318-334, 1990.
40. D. B. Shmoys, "Cut problems and their application to divide-and-conquer," in Approximation Algorithms for NP-hard Problems, (D.S. Hochbaum, ed). PWS, 1997, pp. 192-235.