Embedding tree metrics into low-dimensional Euclidean spaces

Discrete and Computational Geometry

Volumn 24, Issue 1, 2000, Pages 105-116

  Gupta, A ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034389097     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004540010020     Document Type: Article

References (12)

1. N. Alon and J. Spencer. The Probabilistic Method. Wiley Interscience, New York, 1992.
2. J. Bourgain. The metrical interpretation of superreflexivity in Banach spaces. Israel Journal of Mathematics, 56(2):222-230, 1986.
3. J. H. Conway and N. J. Sloane. Sphere Packings, Lattices and Groups. Springer-Verlag, New York, 1992.
4. S. Dasgupta and A. Gupta. A simple proof of the Johnson-Lindenstrauss lemma. Technical Report 99-006, International Computer Science Institute, 1999.
5. A. Gupta. Embedding trees into low dimensional Euclidean spaces. In Proceedings of the 31st Annual IEEE Symposium on Theory of Computing, pp. 694-700, 1999.
6. P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 604-613, 1998.
7. W. B. Johnson and J. Lindenstrauss. Extensions of Lipschitz maps into a Hilbert space. Contemporary Mathematics, 26:189-206, 1984.
8. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215-245, 1995. (Preliminary version in: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 577-591, 1994).
9. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215-245, 1995. (Preliminary version in: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 577-591, 1994).
10. N. Linial, A. Magen, and M. Saks. Trees and Euclidean metrics. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 169-177, 1998.
11. J. Matoušek. Bi-Lipschitz embeddings into low dimensional Euclidean spaces. Commentationes Mathematicae Universitatis Carolinae, 31(3):589-600, 1990.
12. J. Matoušek. On embedding trees into uniformly convex Banach spaces. Israel Journal of Mathematics, to appear. (Czech version: Lipschitz Distance of Metric Spaces, C.Sc. degree thesis, Charles University, 1990).