Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 102-111

  Chawla, Shuchi ^a   Gupta, Anupam ^a   Räcke, Harald ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; DISCRETE GEOMETRY; EUCLIDEAN METRICS;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; COMPUTER SCIENCE; FINITE ELEMENT METHOD; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

METRIC SYSTEM;

EID: 20744432321     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. [AR98] Yonatan Aumann and Yuval Rabani. An O(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM J. Comput., 27(1):291-301, 1998.
2. [ARV04] Sanjeev Arora, Satish Rao, and Umesh Vazirani. Expander flows, geometric embeddings, and graph partitionings. In Proc. 36th STOC, pages 222-231, 2004.
3. [Bar98] Yair Bartal. On approximating arbitrary metrics by tree metrics. In Proc. 30th STOC, pages 161-168, 1998.
4. [Bou85] Jean Bourgain. On Lipschitz embeddings of nite metric spaces in Hilbert space. Israel Journal of Mathematics, 52(1-2):46-52, 1985.
5. 1. In Proc. 14th SODA, pages 527-536, 2003.
6. [Cla95] Kenneth L. Clarkson. Las Vegas algorithms for linear and integer programming when the dimension is small. J. Assoc. Comput. Mach., 42(2):488-499, 1995.
7. [DL97] Michel Marie Deza and Monique Laurent. Geometry of cuts and metrics, volume 15 of Algorithms and Combinatorics. Springer-Verlag, Berlin, 1997.
8. [FRT03] Jittat Fakcharoenphol, Satish Rao, and Kunal Talwar. A tight bound on approximating arbitrary metrics by tree metrics. In Proceedings of the thirty-fifth ACM symposium on Theory of computing, pages 448-455. ACM Press, 2003.
9. [GKL03] Anupam Gupta, Robert Krauthgamer, and James R. Lee. Bounded geometries, fractals, and low-distortion embeddings. In Proc. 44th FOCS, pages 534-543, 2003.
10. 1-embeddings of graphs. Combinatorica, 24(2):233-269, 2004.
11. (Preliminary version in 40th FOCS, 1999.).
12. [Goe97] Michel X. Goemans. Semide nite programming and combinatorial optimization. Mathematical Programming, 49:143-161, 1997.
13. [Ind01] Piotr Indyk. Algorithmic aspects of geometric embeddings. In Proc. 42nd FOCS, pages 10-33, 2001.
14. [Kar85] Alexander V. Karzanov. Metrics and undirected cuts. Mathematical Programming, 32(2):183-198, 1985.
15. [KLMN04] Robert Krauthgamer, James Lee, Manor Mendel, and Assaf Naor. Measured descent: A new embedding method for nite metrics. In Proc. 45th FOCS, 2004. To appear.
16. [Lee05] James R. Lee. On distance scales, embeddings, and efficient relaxations of the cut cone. In Proc. 16th SODA, 2005. To appear.
17. [Lin02] Nathan Linial. Finite metric-spaces - combinatorics, geometry and algorithms. In Proceedings of the International Congress of Mathematicians, Vol. III (Beijing, 2002), pages 573-586, Beijing, 2002. Higher Ed. Press.
18. [LLR95] Nathan Linial, Eran London, and Yuri Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215-245, 1995.
19. (Preliminary version in 35th FOCS, 1994).
20. [LN04] James Lee and Assaf Naor. Extending lipschitz functions via random metric partitions. Inventiones Mathematicae, 2004. To appear.
21. [LR99] F. Thomson Leighton and Satish B. Rao. Multi-commodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM, 46(6):787-832, 1999.
22. (Preliminary version in 29th FOCS, pages 422-431, 1988).
23. [LW94] Nick Littlestone and Manfred K. Warmuth. The weighted majority algorithm. Inform. and Comput., 108(2):212-261, 1994.
24. [Mat96] Jiří Matoušek. On the distortion required for embedding nite metric spaces into nonned spaces. Israel Journal of Mathematics, 93:333-344, 1996.
25. [Mat99] Jiří Matoušek. On embedding trees into uniformly convex Banach spaces. Israel Journal of Mathematics, 114:221-237, 1999.
26. (Czech version in: Lipschitz distance of metric spaces, C.Sc. degree thesis, Charles University, 1990).
27. [Mat02] Jiří Matoušek. Lectures on discrete geometry, volume 212 of Graduate Texts in Mathematics. Springer-Verlag, New York, 2002.
28. 1. In Proceedings of the thirty-fifth ACM symposium on Theory of computing, pages 456-462. ACM Press, 2003.
29. [Rao99] Satish B. Rao. Small distortion and volume preserving embeddings for planar and Euclidean metrics. In 15th Annual ACM Symposium on Computational Geometry, pages 300-306, 1999.
30. [Shm97] David B. Shmoys. Cut problems and their application to divide-and-conquer. In Dorit S. Hochbaum, editor, Approximation Algorithms for NP-hard Problems, pages 192-235. PWS Publishing, 1997.
31. [SM90] Farhad Shahrokhi and D. W. Matula. The maximum concurrent flow problem. J. Assoc. Comput. Mach., 37(2):318-334, 1990.
32. [Wel96] Emo Welzl. Suchen und Konstruieren durch Verdoppeln. In Ingo Wegener, editor, Highlights der Informatik, pages 221-228, Berlin, 1996. Springer.