Bounded geometries, fractals, and low-distortion embeddings

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2003, Pages 534-543

  Gupta, Anupam ^a   Krauthgamer, Robert ^b   Lee, James R ^b  

^a Carnegie Mellon University   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FRACTALS; GRAPH THEORY; PROBABILITY; THEOREM PROVING; TREES (MATHEMATICS); COMBINATORIAL MATHEMATICS; COMPUTER SCIENCE; DOMAIN DECOMPOSITION METHODS; FORESTRY; GEOMETRY; POWER GENERATION; ROBUSTNESS (CONTROL SYSTEMS); SET THEORY; TOPOLOGY;

BOUNDED GEOMETRIES; DECOMPOSITION THEOREMS; DOUBLING METRICS; FINITE METRIC SPACES; LOW DISTORTION EMBEDDINGS; METRIC SPACE;

COMPUTER SCIENCE; TREES (MATHEMATICS);

ALGORITHM DESIGN AND ANALYSIS; DECOMPOSITION THEOREMS; DIMENSIONALITY REDUCTION; DOUBLING DIMENSIONS; DOUBLING METRICS; EXTRATERRESTRIAL MEASUREMENTS; LOW-DISTORTION EMBEDDINGS; TREE GRAPH;

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

References (36)

1. N. Alon and J. H. Spencer. The probabilistic method. Wiley-Interscience, New York, second edition, 2000.
2. n. Bull. Soc. Math. France, 111(4):429-448, 1983.
3. Y. Aumann and Y. Rabani. An O(Log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM J. Comput., 27(1):291-301, 1998.
4. J. Bourgain. On Lipschitz embedding of finite metric spaces in Hilbert space. Israel J. Math., 52(1-2):46-52, 1985.
5. J. Bourgain. The metrical interpretation of superreflexivity in Banach spaces. Israel J. Math., 56(2):222-230, 1986.
6. 1. To appear in 44th Annual IEEE Symposium on Foundations of Computer Science, 2003.
7. G. Calinescu, H. Karloff, and Y. Rabani. Approximation algorithms for the 0-extension problem. In 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 8-16, SIAM, 2001.
8. F. R. K. Chung and P. D. Seymour. Graphs with small bandwidth and cutwidth. Discrete Math., 75(1-3):113-119, 1989.
9. K. L. Clarkson. Nearest neighbor queries in metric spaces. In 29th Annual ACM Symposium on Theory of Computing, pages 609-617. ACM, New York, 1997.
10. M. M. Deza and M. Laurent. Geometry of cuts and metrics. Springer-Verlag, Berlin, 1997.
11. U. Feige. Approximating the bandwidth via volume respecting embeddings. J. Comput. System Sci., 60(3):510-539, 2000.
12. A. Gupta. Improved bandwidth approximation for trees and chordal graphs. J. Algorithms, 40(1):24-36, 2001.
13. 1-embeddings of graphs. In 40th Annual Symposium on Foundations of Computer Science, pages 399-408. IEEE, 1999.
14. J. Heinonen. Lectures on analysis on metric spaces. Universitext. Springer-Verlag, New York, 2001.
15. P. Indyk. Algorithmic applications of low-distortion geometric embeddings. In 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 10-33, 2001.
16. W. B. Johnson and J. Lindenstrauss. Extensions of Lipschitz mappings into a Hilbert space. In Conference in modern analysis and probability, pages 189-206. Amer. Math. Soc., Providence, RI, 1984.
17. D. Karger and M. Ruhl. Finding nearest neighbors in growth-restricted metrics. In 34th Annual ACM Symposium on the Theory of Computing, pages 63-66, 2002.
18. R. Krauthgamer and J. R. Lee. The intrinsic dimensionality of graphs. In 35th Annual ACM Symposium on Theory of Computing, pages 438-447. ACM, 2003.
19. R. Krauthgamer and J. R. Lee. Navigating nets: Simple algorithms for proximity search. Manuscript, July 2003.
20. T. J. Laakso. Ahlfors Q-regular spaces with arbitrary Q < 1 admitting weak Poincaré inequality. Geom. Funct. Anal., 10(1):111-123, 2000.
21. N. Bull. London Math. Soc., 34(6):667-676, 2002.
22. U. Lang and C. Plaut. Bilipschitz embeddings of metric spaces into space forms. Geom. Dedicata, 87(1-3):285-307, 2001.
23. 1: Dimension, snowflakes, and average distortion. Manuscript, July 2003.
24. 1. Manuscript, June 2003.
25. N. Linial. Finite metric spaces - combinatorics, geometry and algorithms. In Proceedings of the International Congress of Mathematicians III, pages 573-586, 2002.
26. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215-245, 1995.
27. p spaces. Israel J. Math., 102:189-197, 1997.
28. J. Matoušek. On embedding trees into uniformly convex Banach spaces. Israel J. Math., 114:221-237, 1999.
29. J. Matousěk. Lectures on discrete geometry, volume 212 of Graduate Texts in Mathematics. Springer-Verlag, 2002.
30. I. Newman and Y. Rabinovich. A lower bound on the distortion of embedding planar metrics into Euclidean space. Discrete Comput. Geom., 29(1):77-81, 2003.
31. T. S. E. Ng and H. Zhang. Predicting internet network distance with coordinates-based approaches. In 21st Annual Joint Conference of the IEEE Computer and Communications Society (INFOCOM-02), pages 170-179, 2002.
32. C. G. Plaxton, R. Rajaraman, and A. W. Richa, Accessing nearby copies of replicated objects in a distributed environment. Theory Comput. Syst., 32(3):241-280, 1999.
33. Y. Rabinovich. On average distortion of embedding metrics into the line and into 11. In 35th Annual ACM Symposium on the Theory of Computing, pages 456-462, 2003.
34. S. Rao. Small distortion and volume preserving embeddings for planar and Euclidean metrics. In 15th Annual Symposium on Computational Geometry, pages 300-306, ACM, 1999.
35. ∞-weights. Rev. Mat. Iberoamericana, 12(2):337-410, 1996.
36. J. B. Tenenbaum, V. de Silva, and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500):2319-2323, 2000.