Embedding metric spaces in their intrinsic dimension

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 363-372

  Abraham, Ittai ^a   Bartal, Yair ^a,b   Neiman, Ofer ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SET THEORY;

ALGORITHMIC TECHNIQUES; APPLICATION FIELDS; DOUBLING DIMENSIONS; FINITE METRIC SPACES; HIGH DIMENSIONAL SPACES; INTRINSIC DIMENSIONS; LOW-DIMENSIONAL REPRESENTATION; METRIC EMBEDDINGS;

TOPOLOGY;

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

References (33)

1. 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings. IEEE Computer Society, 2005.
2. Ittai Abraham, Yair Bartal, Hubert T.-H. Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Ofer Neiman, and Aleksandrs Slivkins. Metric embeddings with relaxed guarantees. In FOCS, [1] pages 83-100.
3. Ittai Abraham, Yair Bartal, Hubert T.-H. Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Ofer Neiman, and Aleksandrs Slivkins. Metric embeddings with relaxed guarantees. In FOCS, [1] pages 83-100.
4. Ittai Abraham, Yair Bartal, and Ofer Neiman. Advances in metric embedding theory. In Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pages 271-286, New York, NY, USA, 2006.
5. Noga Alon. A parallel algorithmic version of the local lemma. In Proceedings of the 32nd annual symposium on Foundations of computer science, pages 586-593, Los Alamitos, CA, USA, 1991. IEEE Computer Society Press.
6. n. Bull. Soc. Math. France, 111(4):429-448, 1983.
7. Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. In 37th Annual Symposium on Foundations of Computer Science (Burlington, VT, 1996), pages 184-193. IEEE Comput. Soc. Press, Los Alamitos, CA, 1996.
8. J. Beck. An algorithmic approach to the lovasz local lemma. Random Struct. Algorithms, 2:343-365, 1991.
9. Mikhail Belkin and Partha Niyogi. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput., 15(6): 1373-1396, 2003.
10. J. Bourgain. On Lipschitz embedding of finite metric spaces in Hilbert space. Israel J. Math., 52(1-2):46-52, 1985.
11. Gruia Calinescu, Howard J. Karloff, and Yuval Rabani. Approximation algorithms for the 0-extension problem. In Symposium on Discrete Algorithms, pages 8-16, 2001.
12. H. Chan, A. Gupta, and K. Talwar, 2007. Personal communication.
13. Manuel Costa, Miguel Castro, Antony I. T. Rowstron, and Peter B. Key. Pic: Practical internet coordinates for distance estimation. In 24th International Conference on Distributed Computing Systems, pages 178-187, 2004.
14. Russ Cox, Frank Dabek, M. Frans Kaashoek, Jinyang Li, and Robert Morris. Practical, distributed network coordinates. ACM SIGCOMM Computer Communication Review, 34(1):113-118, 2004.
15. Jittat Fakcharoenphol, Satish Rao, and Kunal Talwar. A tight bound on approximating arbitrary metrics by tree metrics. In Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, pages 448-455. ACM Press, 2003.
16. Paul Francis, Sugih Jamin, Cheng Jin, Yixin Jin, Danny Raz, Yuval Shavitt, and Lixia Zhang. Idmaps: a global internet host distance estimation service. IEEE/ACM Trans. Netw., 9(5):525-540, 2001.
17. Anupam Gupta, Robert Krauthgamer, and James R. Lee. Bounded geometries, fractals, and low-distortion embeddings. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, page 534, Washington, DC, USA, 2003. IEEE Computer Society.
18. Sariel Har-Peled and Manor Mendel. Fast construction of nets in low-dimensional metrics and their applications. SIAM J. Comput, 35(5):1148-1184, 2006.
19. W. B. Johnson and J. Lindenstrauss. Extensions of Lipschitz mappings into a Hilbert space. In Conference in modern analysis and probability (New Haven, Conn., 1982), pages 189-206. Amer. Math. Soc., Providence, RI, 1984.
20. Jon M. Kleinberg, Aleksandrs Slivkins, and Tom Wexler. Triangulation and embedding using small sets of beacons. In FOCS, pages 444-453, 2004.
21. R. Krauthgamer, J. R. Lee, M. Mendel, and A. Naor. Measured descent: A new embedding method for finite metrics. In 45th Annual IEEE Symposium on Foundations of Computer Science, pages 434-443. IEEE, October 2004.
22. Hyuk Lim, Jennifer C. Hou, and Chong-Ho Choi. Constructing internet coordinate system based on delay measurement. In 3rd ACM SIGCOMM Conference on Internet Measurement, pages 129-142, 2003.
23. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215-245, 1995.
24. Nathan Linial and Michael Saks. Decomposing graphs into regions of small diameter. In Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, pages 320-330, Philadelphia, PA, USA, 1991. Society for Industrial and Applied Mathematics.
25. Jiri Matoušek. Open problems on low-distortion embeddings of finite metric spaces, 2005. Available in http://kam.mff.cuni.cz/matousek/metrop. ps.gz.
26. T. S. Eugene Ng and Hui Zhang. Predicting internet network distance with coordinates-based approaches. In 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pages 178-187, 2002.
27. David Peleg. Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications, 2000.
28. S. Rao. Small distortion and volume preserving embeddings for planar and Euclidean metrics. In Proceedings of the Fifteenth Annual Symposium on Computational Geometry, pages 300-306, New York, 1999. ACM.
29. ∞ weights. Revista Matemática Iberoamericana, 12:337-410, 1996.
30. Yuval Shavitt and Tomer Tankel. Big-bang simulation for embedding network distances in euclidean space. IEEE/ACM Trans. Netw., 12(6):993-1006, 2004.
31. th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 41-50. ACM Press, July 2005. Appears earlier as Cornell CIS technical report TR2005-1977.
32. Kunal Talwar. Bypassing the embedding: algorithms for low dimensional metrics. In STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pages 281-290. ACM Press, 2004.
33. Mikkel Thorup and Uri Zwick. Approximate distance oracles. J. ACM, 52(1):1-24, 2005.