Metric embeddings with relaxed guarantees

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2005, Issue , 2005, Pages 83-100

  Abraham, Ittai ^a   Bartal, Yair ^a   Chan, T H Hubert ^b   Dhamdhere, Kedar ^b   Gupta, Anupam ^b   Kleinberg, Jon ^c   Neiman, Ofer ^a   Slivkins, Aleksandrs ^c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b Carnegie Mellon University   (United States)

^c Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE ELEMENT METHOD; GRAPH THEORY; INTERNET; MATHEMATICAL MODELS; PROBLEM SOLVING;

EUCLIDEAN SPACE; LOWER BOUNDS; RELAXED GUARANTEES; SMALL DIMENSION;

EMBEDDED SYSTEMS;

EID: 33748589199     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2005.51     Document Type: Conference Paper

References (43)

1. I. Abraham, Y. Bartal, and O. Neiman. On embedding of finite metric spaces into Hilbert space, 2005. Manuscript.
2. N. Alon, R. M. Karp, D. Peleg, and D. West. A graphtheoretic game and its application to the k-server problem. SIAM J. Comput., 24(1), 1995.
3. S. Arora, J. R. Lee, and A. Naor. Euclidean distortion and the sparsest cut. In 37th STOC, 2005.
4. n. Bull. Soc. Math. France, 111(4), 1983.
5. Y. Bartal. Probabilistic approximations of metric spaces and its algorithmic applications. In 37th FOCS, 1996.
6. Y. Bartal. On approximating arbitrary metrics by tree metrics. In 30th STOC, pages 183-193, 1998.
7. Y. Bartal. Graph decomposition lemmas and their role in metric embedding methods. In 12th Annual European Symposium on Algorithms, pages 89-97, 2004.
8. Y. Bartal. On embedding finite metric spaces into low-dimensional normed spaces. Manuscript, 2005.
9. Y. Bartal, B. Bollobás, and M. Mendel. Ramsey-type theorems for metric spaces with applications to online problems, 2002. To appear in Special issue of Journal of Computer and System Science.
10. Y. Bartal, N. Linial, M. Mendel, and A. Naor. On metric ramsey-type phenomena. Annals Math, 2003. To appear.
11. J. Bourgain. On Lipschitz embeddings of finite metric spaces in Hilbert space. Israel J. of Mathematics, 52(1-2), 1985.
12. J. Bourgain. The metrical interpretation of superreflexivity in Banach spaces. Israel J. Math., 56(2):222-230, 1986.
13. J. Bourgain, T. Figiel, and V. Milman. On Hilbertian subsets of finite metric spaces. Israel J. Math., 55(2):141-152, 1986.
14. B. Brinkman and M. S. Charikar. On the impossibility of dimension reduction in 11. In 44th FOCS, 2003.
15. F. Dabek, R. Cox, F. Kaashoek, and R. Morris. Vivaldi: A decentralized network coordinate system. In ACM SIGCOMM, 2004.
16. p-spaces. Ark. Mat., 8:103-105 (1969), 1969.
17. J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. In STOC, 2003.
18. J. Fakcharoenphol and K. Talwar. An improved decomposition theorem for graphs excluding a fixed minor. RANDOM-APPROX, 2003.
19. M. Fomenkov, k. claffy, B. Huffaker, and D. Moore. Macroscopic Internet topology and performance measurements from the DNS root name servers. In Usenix LISA, 2001.
20. P. Francis, S. Jamin, C. Jin, Y. Jin, D. Raz, Y. Shavitt, and L. Zhang. IDMaps: A global Internet host distance estimation service. IEEE/ACM Transactions on Networking, 9:525-540, October 2001.
21. A. Gupta, R. Krauthgamer, and J. R. Lee. Bounded geometries, fractals, and low-distortion embeddings. In 44th FOCS, 2003.
22. 1-embeddings of graphs. Combinatorica, 24(2), 2004.
23. J. Guyton and M. Schwartz. Locating nearby copies of replicated Internet servers. In ACM SIGCOMM, 1995.
24. J. Heinonen. Lectures on analysis on metric spaces. Universitext. Springer-Verlag, 2001.
25. P. Indyk. Algorithmic aspects of geometric embeddings. In 42nd FOCS, 2001.
26. P. Indyk and J. Matoušek. Low-distortion embeddings of finite metric spaces. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, Discrete Mathematics and its Applications (Boca Raton), chapter 8. Chapman & Hall/CRC, Boca Raton, FL, second edition, 2004.
27. D. R. Karger and M. Ruhl. Finding nearest neighbors in growth-restricted metrics. In 34th Annual ACM Symposium on the Theory of Computing, 2002.
28. P. Klein, S. A. Plotkin, and S. B. Rao. Excluded minors, network decomposition, and multicommodity flow. In 25th STOC, 1993.
29. J. M. Kleinberg, A. Slivkins, and T. Wexler. Triangulation and embedding using small sets of beacons. In 45th FOCS, 2004.
30. C. Kommareddy, N. Shankar, and B. Bhattacharjee. Finding close friends on the Internet. In 12th IEEE Intl. Conf. on Network Protocols (INCP), 2001.
31. R. Krauthgamer, J. Lee, M. Mendel, and A. Naor. Measured descent: A new embedding method for finite metrics. In 45th FOCS, 2004.
32. J. R. Lee. On distance scales, embeddings, and efficient relaxations of the cut cone. In 16th SODA, 2005.
33. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2), 1995.
34. p spaces. Israel J. Math., 102, 1997.
35. M. Mendel and S. Har-Peled. Fast construction of nets in low dimensional metrics, and their applications. In 21st SoCG, 2005.
36. T. Ng and H. Zhang. Predicting Internet network distance with coordinates-based approaches. In IEEE INFOCOM, 2002.
37. T. Ng and H. Zhang. A network positioning system for the Internet. In USENIX, 2004.
38. C. G. Plaxton, R. Rajaraman, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. Theory Comput. Syst., 32(3), 1999.
39. Y. Rabinovich and R. Raz. Lower bounds on the distortion of embedding finite metric spaces in graphs. Discrete Comput. Geom., 19(1), 1998.
40. S. B. Rao. Small distortion and volume preserving embeddings for planar and Euclidean metrics. In 15th SoCG, 1999.
41. Y. Shavitt and T. Tankel. Big-bang simulation for embedding network distances in euclidean space. In IEEE INFOCOM, 2003.
42. A. Slivkins. Distributed approaches to triangulation and embedding. In 16th SODA, 2005.
43. K. Talwar. Bypassing the embedding: Algorithms for low-dimensional metrics. In 36th STOC, 2004.