Approximating TSP on metrics with bounded global growth

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 690-699

  Hubert Chan, T H ^a   Gupta, Anupam ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION SCHEMES; CORRELATION DIMENSION (CD); EUCLIDEAN METRICS; NP COMPLETE PROBLEMS;

APPROXIMATION ALGORITHMS;

TRAVELING SALESMAN PROBLEM;

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

References (39)

1. Ittai Abraham, Cyril Gavoille, Andrew Goldberg, and Dahlia Malkhi. Routing in networks with low doubling dimension. In 26th ICDCS, page 75, 2006.
2. Ittai Abraham and Dahlia Malkhi. Name independent routing for growth bounded networks. In 17th SPAA, pages 49-55, 2005.
3. Stefan Arnborg and Andrzej Proskurowski. Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl. Math., 23(1):11-24, 1989.
4. S. Arora. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM, 45(5):753-782, 1998.
5. Sanjeev Arora, Prabhakar Raghavan, and Satish Rao. Approximation schemes for Euclidean k-medians and related problems. In STOC '98 (Dallas, TX), pages 106-113. ACM, New York, 1999.
6. Yair Bartal. Probabilistic approximations of metric spaces and its algorithmic applications. In 37th FOCS, pages 184-193, 1996.
7. Alberto Belussi and Christos Faloutsos. Estimating the selectivity of spatial queries using the 'correlation' fractal dimension. In 21st VLDB, pages 299-310, 1995.
8. Alina Beygelzimer, Sham Kakade, and John Langford. Cover trees for nearest neighbor. In 23rd International Conference on Machine Learning, pages 97-104, 2006.
9. Hubert T-H. Chan, Anupam Gupta, Bruce M. Maggs, and Shuheng Zhou. On hierarchical routing in DOubling metrics. In 16th SODA, pages 762-771, 2005.
10. Kenneth L. Clarkson. Nearest-neighbor searching and metric space dimensions. In G. Shakhnarovich, T. Darrell, and P. Indyk, editors, Nearest-Neighbor Methods for Learning and Vision: Theory and Practice, pages 15-59. MIT Press, 2006.
11. Richard Cole and Lee-Ad Gottlieb. Searching dynamic point sets in spaces with bounded doubling dimension. In 38th STOC, pages 574-583, 2006.
12. Artur Czumaj and Andrzej Lingas. Fast approximation schemes for Euclidean multi-connectivity problems (extended abstract). In Automata, languages and programming (Geneva, 2000), volume 1853 of Lecture Notes in Comput. Sci., pages 856-868. Springer, Berlin, 2000.
13. Artur Czuinaj, Andrzej Lingas, and Hairong Zhao. Polynomial-time approximation schemes for the Euclidean survivable network design problem. In Automata, languages and programming, volume 2380 of Lecture Notes in Comput. Sci., pages 973-984. Springer, Berlin, 2002.
14. Jittat Fakcharoenphol, Satish Rao, and Kunal Talwar. A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. System Sci., 69(3):485-497, 2004.
15. Christos Faloutsos and Ibrahim Kamel. Beyond uniformity and independence: Analysis of r-trees using the concept of fractal dimension. In 13th PODS, pages 4-13, 1994.
16. Peter Grassberger and Itamar Procaccia. Measuring the strangeness of strange attractors. Physica D, 9:189-208, 1983.
17. Michelangelo Grigni. Approximate tsp in graphs with forbidden minors. In 21st ICALP, pages 869-877, 2000.
18. Anupam Gupta, Robert Krauthgamer, and James R. Lee. Bounded geometries, fractals, and low-distortion embeddings. In 44th FOCS, pages 534-543, 2003.
19. Sariel Har-Peled and Manor Mendel. Fast constructions of nets in low dimensional metrics, and their applications. In 21st SOCG, pages 150-158, 2005.
20. 1-∈ In 31th FOCS, pages 627-636, 1996.
21. K. Hildrum, J. D. Kubiatowicz, S. Rao, and B. Y. Zhao. Distributed object location in a dynamic network. In 14th SPAA, pages 41-52, August 2002.
22. David R. Karger and Matthias Ruhl. Finding nearest neighbors in growth-restricted metrics. In 34th STOC, pages 63-66, 2002.
23. Philip N. Klein. A linear-time approximation scheme for planar weighted tsp. In 46th FOCS, pages 647-657, 2005.
24. Jon M. Kleinberg, Aleksandrs Slivkins, and Tom Wexler. Triangulation and embedding using small sets of beacons. In 45th FOCS, pages 444-453, 2004.
25. Leonard Kleinrock and Farouk Kamoun. Hierarchical routing for large networks. Performance evaluation and optimization. Comput. Networks, 1(3):155-174, 1976/77.
26. Stavros G. Kolliopoulos and Satish Rao. A nearly linear-time approximation scheme for the Euclidean kmedian problem. In Algorithms-ESA '99 (Prague), volume 1643 of Lecture Notes in Comput. Sci., pages 378-389. Springer, Berlin, 1999.
27. Goran Konjevod, Andréa W. Richa, and Donglin Xia. On sampling in higher-dimensional peer-to-peer systems. In LATIN 2006: Theoretical informatics, volume 3887 of Lecture Notes in Comput. Sci., pages 641-652, Berlin, 2006. Springer.
28. Goran Konjevod, Andréa W. Richa, and Donglin Xia. Optimal-stretch name-independent compact routing in doubling metrics. In 25th PODC, pages 198-207, 2006.
29. Robert Krauthgamer and James R. Lee. Navigating nets: simple algorithms for proximity search. In 15th SODA, pages 798-807, 2004.
30. Robert Krauthgamer and James R. Lee. The blackbox complexity of nearest-neighbor search. Theoret. Comput. Sci., 348(2-3):262-276, 2005.
31. F. Kuhn, T. Moscibroda, and R. Wattenhofer. On the locality of bounded growth. In 24th PODC, pages 60-68, 2005.
32. Joseph S. B. Mitchell. Guillotine subdivisions approximate polygonal subdivisions: a simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM J. Comput., 28(4):1298-1309, 1999.
33. Bernd-Uwe Pagel, Flip Korn, and Christos Faloutsos. Deflating the dimensionality curse using multiple fractal dimensions. In ICDE, pages 589-598, 2000.
34. Christos H. Papadimitriou and Mihalis Yannakakis. The traveling salesman problem with distances one and two. Math. Oper. Res., 18(1):1-11, 1993.
35. 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. ACM Symposium on Parallel Algorithms and Architectures (Padua, 1996).
36. Satish B. Rao and Warren D. Smith. Approximating geometrical graphs via "spanners" and "banyans". In STOC '98 (Dallas, TX), pages 540-550. ACM, New York, 1999.
37. Aleksandrs Slivkins. Distance estimation and object location via rings of neighbors. In 24th PODC, pages 41-50, 2005.
38. Kunal Talwar. Bypassing the embedding: Algorithms for low-dimensional metrics. In 36th STOC, pages 281-290, 2004.
39. Luca Trevisan. When Hamming meets Euclid: the approximability of geometric TSP and Steiner tree. SIAM J. Comput., 30(2):475-485, 2000.