Bypassing the embedding: Algorithms for low dimensional metrics

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 281-290

  Talwar, Kunal ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Distance Labels; Doubling Metrics; PTAS; Routing Schemes; TSP

Indexed keywords

DISTANCE LABELS; DOUBLING METRICS; PTAS; ROUTING SCHEMES; TSP;

ALGORITHMS; COMPUTATIONAL GEOMETRY; PETRI NETS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SET THEORY; THEOREM PROVING; TRAVELING SALESMAN PROBLEM;

MATRIX ALGEBRA;

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

References (45)

1. N. Alon, R. M. Karp, D. Peleg, and D. West. A graph-theoretic game and its application to the k-server problem. SIAM J. Comput. 24(1):78-100, 1995.
2. S. Arora. Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In 37th Annual Symposium on Foundations of Computer Science, pages 2-11, Burlington, Vermont, 14-16 Oct. 1996. IEEE.
3. S. Arora. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM, 45(5):753-782, 1998.
4. S. Arora. Approximation schemes for NP-hard geometric optimization problems: a survey. Mathematical Programming, 97(1-2):43-69, 2003.
5. S. Arora, P. Raghavan, and S. Rao. Approximation schemes for Euclidean k-medians and related problems. In ACM Symposium on Theory of Computing (STOC), 1998.
6. n. Bull. Soc. Math. France, 111(4):429-448, 1983.
7. B. Awerbuch, A. B. Noy, N. Linial, and D. Peleg. Improved routing strategies with succinct tables. J. Algorithms, 11(3):307-341, 1990.
8. B. Awerbuch and D. Peleg. Routing with polynomial communication-space trade-off. SIAM J. Discret. Math., 5(2):151-162, 1992.
9. Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. In 37th Annual Symposium on Foundations of Computer Science, pages 184-193. IEEE, 1996.
10. Y. Bartal. On approximating arbitrary metrices by tree metrics. In 30th Annual A CM Symposium on Theory of Computing, pages 161-168. ACM, 1998.
11. A. Z. Broder, M. Charikar, A. M. Frieze, and M. Mitzenmacher. Min-wise independent permutations. Journal of Computer and System Sciences, 60(3):630-659, 2000.
12. 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.
13. P. B. Callahan and S. R. Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. ACM, 42(1):67-90, 1995.
14. M. Charikar, C. Chekuri, A. Goel, S. Guha, and S. Plotkin. Approximating a finite metric by a small number of tree metrics. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science, page 379. IEEE Computer Society, 1998.
15. K. L. Clarkson. Nearest neighbor queries in metric spaces. Discrete Comput. Geom., 22(1):63-93, 1999.
16. L. J. Cowen. Compact routing with minimum stretch. J. Algorithms, 38(1):170-183, 2001.
17. T. Eilam, C. Gavoille, and D. Peleg. Compact routing schemes with low stretch factor (extended abstract). In Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing, pages 11-20. ACM Press, 1998.
18. J. Fakcharoenphol, C. Harrelson, S. Rao, and K. Talwar. An improved approximation algorithm for the 0-extension problem. In ACM-SIAM Symposium on Discrete Algorithms. 2003.
19. J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. In 35th Annual ACM Symposium on Theory of Computing. ACM, 2003.
20. C. Gavoille, M. Katz, N. A. Katz, C. Paul, and D. Peleg. Approximate distance labeling schemes. In Proceedings of the 9th Annual European Symposium on Algorithms, pages 476-487. Springer-Verlag, 2001.
21. C. Gavoille and D. Peleg. Compact and localized distributed data structures. Distrib. Comput., 16(2-3):111-120, 2003.
22. C. Gavoille, D. Peleg, S. Perennes, and R. Raz. Distance labeling in graphs. In ACM-SIAM Symposium on Discrete Algorithms, pages 210-219, 2001.
23. J. Gudmundsson, C. Levcopoulos, G. Narasimhan, and M. Smid. Approximate distance oracles for geometric graphs. In Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, pages 828-837. Society for Industrial and Applied Mathematics, 2002.
24. A. Gupta, R. Krauthgamer, and J. Lee. Bounded geometries, fractals and low-distortion embeddings. In Foundations of Computer Science, 2003.
25. S. Har-Peled and S. Mazumdar. Coresets for k-means and k-median clustering and their applications. In These Proceedings, 2004.
26. K. Hildrum, J. Kubiatowicz, S. Ma, and S. Rao. A note on finding the nearest neighbor in growth-restricted metrics. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 553-4, 2004.
27. P. Indyk. Algorithms for dynamic geometric problems over data streams. In These Proceedings, 2004.
28. 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.
29. S. Kolliopoulos and S. Rao. A nearly linear-time approximation scheme for the Euclidean k-median problem. In ESA: Annual European Symposium on Algorithms, 1999.
30. R. Krauthgamer and J. Lee. Navigating nets: simple algirithms for proximity search. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004.
31. R. Krauthgamer and J. Lee. Nearest neighbour search in the blackbox model. Manuscript, 2004.
32. N. Bull. London Math. Soc., 34(6):667-676, 2002.
33. U. Lang and C. Plaut. Bilipschitz embeddings of metric spaces into space forms. Geom. Dedicata, 87(1-3):285-307, 2001.
34. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215-245, 1995.
35. J. S. B. Mitchell. Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM Journal on Computing, 28(4):1298-1309, Aug. 1999.
36. 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.
37. D. Peleg. Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics, 2000.
38. D. Peleg. Proximity preserving labeling schemes. Journal of Graph Theory, 33:167-176, 2000.
39. D. Peleg and E. Upfal. A trade-off between space and efficiency for routing tables. J. ACM, 36(3):510-530, 1989.
40. S. A. Plotkin, D. B. Shmoys, and Éva Tardos. Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res., 20(2):257-301, 1995.
41. S. B. Rao and W. D. Smith. Approximating geometrical graphs via spanners and banyans. In Proceedings of the thirtieth annual ACM symposium on Theory of computing, pages 540-550. ACM Press, 1998.
42. J. B. Tenenbaum, V. de Silva, and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500):2319-2323, 2000.
43. M. Thorup and U. Zwick. Approximate distance oracles. In Proceedings of the thirty-third annual ACM symposium on Theory of computing, pages 183-192. ACM Press, 2001.
44. M. Thorup and U. Zwick. Compact routing schemes. In Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures, pages 1-10. ACM Press, 2001.
45. L. Trevisan. When Hamming meets Euclid: The approximability of geometric TSP and steiner tree. SICOMP: SIAM Journal on Computing, 30, 2000.