Euclidean distortion and the Sparsest Cut

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 553-562

  Arora, Sanjeev ^a   Lee, James R ^b   Naor, Assaf ^c  

^a PRINCETON UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

Approximation Algorithms; Metric Embeddings; Semidefinite Programming; Sparsest Cut

Indexed keywords

APPROXIMATION ALGORITHMS; METRIC EMBEDDINGS; SEMIDEFINITE PROGRAMMING; SPARSEST CUT;

APPROXIMATION THEORY; COMPUTER PROGRAMMING; EMBEDDED SYSTEMS; POLYNOMIALS; SET THEORY;

ALGORITHMS;

EID: 34848848456     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060673     Document Type: Conference Paper

References (28)

1. D. Achlioptas. Database-friendly random projections: Johnson-Lindenstrauss with binary coins. J. Comput. System Sci., 66(4):671-687, 2003. Special issue on PODS 2001 (Santa Barbara, CA).
2. 2) time. In 45th Annual Syposium on Foundations of Computer Science, pages 238-247. IEEE Computer Society, 2004.
3. S. Arora, S. Rao, and U. Vazirani. Expander flows, geometric embeddings, and graph partitionings. In 36th Annual Symposium on the Theory of Computing, pages 222-231, 2004.
4. Y. Aumann and Y. Rabani. An O(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM J. Comput., 27(1):291-301 (electronic), 1998.
5. Y. Bartal. Probabilistic approximations of metric space and its algorithmic application. In 37th Annual Symposium on Foundations of Computer Science, pages 183-193, Oct. 1996.
6. J. Bourgain. On Lipschitz embedding of finite metric spaces in Hilbert space. Israel J. Math., 52(1-2):46-52, 1985.
7. 1. In Proceedings of the 44th Annual IEEE Conference on Foundations of Computer Science. ACM, 2003.
8. S. Chawla, A. Gupta, and H. Räcke. An improved approximation to sparsest cut. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, Vancouver, 2005. ACM.
9. 1. Manuscript, 2004.
10. p-spaces. Ark. Mat., 8:103-105, 1969.
11. J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pages 448-455, 2003.
12. T. Figiel, J. Lindenstrauss, and V. D. Milman. The dimension of almost spherical sections of convex bodies. Acta Math., 139(1-2):53-94, 1977.
13. J. Heinonen. Lectures on analysis on metric spaces. Universitext. Springer-Verlag, New York, 2001.
14. W. B. Johnson and J. Lindenstrauss. Extensions of Lipschitz mappings into a Hilbert space. In Conference in modern analysis and probability (New Haven, Conn., 1982), pages 189-206. Amer. Math. Soc., Providence, RI, 1984.
15. 1. Manuscript, 2004.
16. R. Krauthgamer, J. R. Lee, M. Mendel, and A. Naor. Measured descent: A new embedding method for finite metrics. Geom. Funct. Anal., 2004. To appear.
17. J. R. Lee. On distance scales, embeddings, and efficient relaxations of the cut cone. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, Vancouver, 2005. ACM.
18. 1: Dimension, snowflakes, and average distortion. European J. Combin., 2004. To appear.
19. 1. Geom. Funct. Anal., 14(4):745-747, 2004.
20. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215-245, 1995.
21. N. Linial and M. Saks. Low diameter graph decompositions. Combinatorica, 13(4):441-454, 1993.
22. J. Matoušek. Lectures on discrete geometry, volume 212 of Graduate Texts in Mathematics. Springer-Verlag, New York, 2002.
23. M. Mendel and A. Naor. Euclidean quotients of finite metric spaces. Adv. Math., 189(2):451-494, 2004.
24. V. D. Milman and G. Schechtman. Asymptotic theory of finite-dimensional normed spaces, volume 1200 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1986. With an appendix by M. Gromov.
25. A. Naor, Y. Peres, O. Schramm, and S. Sheffield. Markov chains in smooth normed spaces and Gromov hyperbolic metric spaces. Preprint, 2004.
26. A. Naor, Y. Rabani, and A. Sinclair. Quasisymmetric embeddings, the observable diameter, and expansion properties of graphs. Preprint, 2004.
27. A. Naor and G. Schechtman. Remarks on non linear type and Pisier's inequality. J. Reine Angew. Math., 552:213-236, 2002.
28. S. Rao. Small distortion and volume preserving embeddings for planar and Euclidean metrics. In Proceedings of the 15th Annual Symposium on Computational Geometry, pages 300-306, New York, 1999. ACM.