A lower bound on the distortion of embedding planar metrics into euclidean space

Discrete and Computational Geometry

Volumn 29, Issue 1, 2003, Pages 77-81

  Newman, Ilan ^a   Rabinovich, Yuri ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037666876     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-002-2813-5     Document Type: Article

References (15)

1. Y. Aumann and Y. Rabani. An O(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM Journal on Computing, 27(1):291-301, February 1998.
2. Y. Bartal. Probabilistic approximations of metric spaces and its algorithmic applications. In Proceedings of the 31th Annual IEEE Symposium on Foundations of Computer Science, pages 184-193, 1996.
3. Y. Bartal. On approximating arbitrary metrics by tree metrics. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 161-168, 1998.
4. J. Bourgain. On Lipschitz embeddings of finite metric spaces in Hubert space. Israel Journal of Mathematics, 52(1-2):46-52, 1985.
5. J. Bourgain. The metrical interpretation of superreflexivity in Banach spaces. Israel Journal of Mathematics, 56(2):222-230, 1986.
6. U. Feige. Approximating the bandwidth via volume respecting embeddings. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 90-99, 1998.
7. 1-embeddings of graphs. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pages 399-408, 1999.
8. W. B. Johnson and J. Lindenstrauss. Extensions of Lipschitz mappings into a Hubert space. Contemporary Mathematics 26:189-206, 1984.
9. P. Klein, S. A. Plotkin and S. B. Rao. Excluded minors, network decomposition, and multicommodity flow. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 682-690, 1993.
10. N. Linial, E. London and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215-245, 1995.
11. N. Linial, J. Matoušek and Y. Rabinovich. Embedding the edges of series-parallel graphs into line. Manuscript, 2000.
12. J. Matoušek. On embedding trees into uniformly convex Banach spaces. Israel Journal of Mathematics, 114:221-237, 1999. (Czech version in: Lipschitz distance of metric spaces, C.Sc. degree thesis, Charles University, 1990.)
13. V. Milman and G. Schechtman. Asymptomic Theory of Finite Dimensional Spaces, LNM 1200, Springer-Verlag, Berlin, 1986.
14. S. B. Rao. Small distortion and volume preserving embeddings for planar and Euclidean metrics. In Proceedings of the 15th Annual ACM Symposium on Computational Geometry, pages 300-306, 1999.
15. P.D. Seymour. Sums of circuits. In J. A. Bondy and U. S. Murty, editors, Graph Theory with Applications, pages 341-355. American Elsevier, New York, 1979.