On distance scales, embeddings, and efficient relaxations of the cut cone

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 92-101

  Lee, James R ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANACH SPACES; EUCLIDEAN DISTANCE; FINITE SET; METRIC SPACES;

COMPUTATIONAL METHODS; FINITE ELEMENT METHOD; FUNCTION EVALUATION; INTERPOLATION; MATHEMATICAL MODELS; MATRIX ALGEBRA; METRIC SYSTEM; SET THEORY; THEOREM PROVING;

PROBLEM SOLVING;

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

References (23)

1. [ALN04] S. Arora, J. R. Lee, and A. Naor. Euclidean distortion and the Sparsest Cut. Manuscript, 2004.
2. [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 (electronic), 1998.
3. [ARV04] Sanjeev Arora, Satish Rao, and Umesh Vazirani. Expander flows, geometric embeddings, and graph partitionings. In 36th Annual Symposium on the Theory of Computing, 2004. To appear.
4. n. Bull. Soc. Math. Prance, 111(4):429-448, 1983.
5. [Bar98] Yair Bartal. On approximating arbitrary metrics by tree metrics. In 30th Annual ACM Symposium on Theory of Computing, pages 183-193, 1998.
6. [BL00] Yoav Benyamini and Joram Lindenstrauss. Geometric nonlinear functional analysis. Vol. 1, volume 48 of American Mathematical Society Colloquium Publications. American Mathematical Society, Providence, RI, 2000.
7. [Bou85] J. Bourgain. On Lipschitz embedding of finite metric spaces in Hilbert space. Israel J. Math., 52(1-2):46-52, 1985.
8. [CGR05] Shuchi Chawla, Anupam Gupta, and Harald Räcke. Embeddings of negative-type metrics and improved approximations to sparsest cut. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), Vancouver, Canada, January 2005.
9. p-spaces. Ark. Mat., 8:103-105, 1969.
10. [FRT03] Jittat Fakcharoenphol, Satish Rao, and Kunal 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.
11. [GKL03] Anupam Gupta, Robert Krauthgamer, and James R. Lee. Bounded geometries, fractals, and low-distortion embeddings. In 44th Symposium on Foundations of Computer Science, pages 534-543, 2003.
12. 1-embeddings of graphs. In 40th Annual Symposium on Foundations of Computer Science, pages 399-408. IEEE Computer Soc., Los Alamitos, CA, 1999.
13. [Goe97] Michel X. Goemans. Semidefinite programming in combinatorial optimization. Math. Programming, 79(1-3, Ser. B):143-161, 1997.
14. Lectures on mathematical programming (ismp97) (Lausanne, 1997).
15. [KLMN04] R. Krauthgamer, J. R. Lee, M. Mendel, and A. Naor. Measured descent: A new embedding method for finite metrics. Submitted, 2004.
16. 1. In Open Problems, Workshop on Discrete Metric Spaces and their Algorithmic Applications. J. Matoušek, Ed., Haifa, 2002.
17. [LLR95] N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215-245, 1995.
18. [Mat02] J. Matoušek. Lectures on discrete geometry, volume 212 of Graduate Texts in Mathematics. Springer-Verlag, New York, 2002.
19. [MN04] M. Mendel and A. Naor. Euclidean quotients of finite metric spaces. To appear, Advances in Mathematics, 2004.
20. [MP84] M. B. Marcus and G. Pisier. Characterizations of almost surely continuous p-stable random Fourier series and strongly stationary processes. Acta Math., 152(3-4):245-301, 1984.
21. 1. In 35th Annual ACM Symposium on Theory of Computing. ACM, 2003. To appear.
22. [Rao99] Satish 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.
23. [Vaz01] V. V. Vazirani. Approximation algorithms. Springer-Verlag, Berlin, 2001.