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

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2002, Pages 94-96

  Newman, Ilan ^a   Rabinovich, Yuri ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

Embedding into Eucledian spaces; Metric Spaces

Indexed keywords

COMPUTATIONAL COMPLEXITY; SET THEORY; THEOREM PROVING; TREES (MATHEMATICS);

PLANAR METRICS;

COMPUTATIONAL GEOMETRY;

EID: 0036367602     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/513400.513412     Document Type: Conference Paper

References (15)

1. An O(log k) approximate min-cut max-flow theorem and approximation algorithm
2. Probabilistic approximations of metric spaces and its algorithmic applications
3. On approximating arbitrary metrics by tree metrics
4. On Lipschitz embeddings of finite metric spaces in Hilbert space
5. The metrical interpretation of superreflexivity in Banach spaces
6. Approximating the bandwidth via volume respecting embeddings
7. 1-embeddings of graphs
8. Extensions of Lipschitz mappings into a Hilbert space
9. Excluded minors, network decomposition, and multicommodity flow
10. The geometry of graphs and some of its algorithmic applications
11. Embedding the edges of series-parallel graphs into line
12. On embedding trees into uniformly convex Banach spaces
13. Asymptotic theory of finite dimensional spaces
14. Small distortion and volume preserving embeddings for planar and Euclidean metrics
15. Sums of circuits