On the Complexity of Approximating TSP with Neighborhoods and Related Problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2832, Issue , 2003, Pages 446-458

  Safra, Shmuel ^a   Schwartz, Oded ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY;

CONSTANT FACTORS; EUCLIDEAN PLANES; GEOMETRIC COVERINGS; GROUP STEINER TREE; INAPPROXIMABILITY FACTOR; NEIGHBOURHOOD; NP-HARD; TRAVELLING SALESMAN PROBLEM;

TRAVELING SALESMAN PROBLEM;

EID: 0142183796     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39658-1_41     Document Type: Article

References (28)

1. [AH94] E. Arkin and R. Hassin. Approximation algorithms for the geometric covering salesman problem. DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science, 55(3):197-218, 1994.
2. [Aro96] S. Arora. Polynomial-time approximation scheme for Euclidean TSP and other geometric problems. In Proceedings of the Symposium on Foundations of Computer Science, pages 2-11, 1996.
3. [Chr76] N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. Technical report, Graduate School of Industrial Administration, Carnegy-Mellon University, 1976.
4. [CJN99] S. Carlsson, H. Jonsson, and B. J. Nilsson. Finding the shortest watchman route in a simple polygon. GEOMETRY: Discrete X Computational Geometry, 22(3):377-402, 1999.
5. [CN88] W. Chin and S. Ntafos. Optimum watchman routes. Information Processing Letters, 28(1):39-44, May 1988.
6. [CVM00] R. D. Carr, S. Vempala, and J. Mandler. Towards a 4/3 approximation for the asymmetric traveling salesman problem. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 116-125, N.Y., January 9-11 2000. ACM Press.
7. +02] M. de Berg, J. Gudmundsson, M.J. Katz, C. Levcopoulos, M. H. Overmars, and A. F. van der Stappen. TSP with neighborhoods of varying size. In ESA: Annual European Symposium on Algorithms, pages 187-199, 2002.
8. [DGKR03] I. Dinur, V. Guruswami, S. Khot, and O. Regev. A new multilayered pep and the hardness of hypergraph vertex cover. In Proceedings of the thirty-fifth ACM symposium on Theory of computing, pages 595-601. ACM Press, 2003.
9. [DM01] A. Dumitrescu and J. S. B. Mitchell. Approximation algorithms for TSP with neighborhoods in the plane. In Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), pages 38-46, New York, January 7-9 2001. ACM Press.
10. [EK01] L. Engebretsen and M. Karpinski. Approximation hardness of TSP with bounded metrics. In ICALP: Annual International Colloquium on Automata, Languages and Programming, pages 201-212, 2001.
11. [Fei98] U. Feige. A threshold of In n for approximating set cover. JACM: Journal of the ACM, 45(4):634-652, 1998.
12. [FGM82] A. Frieze, G. Galbiati, and F. Maffioli. On the worst-case performance of some algorithms for the asymmetric travelling salesman problem. Networks, 12:23-39, 1982.
13. [GGJ76] M. R. Garey, R. L. Graham, and D. S. Johnson. Some NP-complete geometric problems. In Conference Record of the Eighth Annual ACM Symposium on Theory of Computing, pages 10-22, Hershey, Pennsylvania, 3-5 May 1976.
14. [GGJ77] M. R. Garey, R. L. Graham, and D. S. Johnson. The complexity of computing Steiner minimal trees. SIAM Journal on Applied Mathematics, 32(4):835-859, June 1977.
15. [GL99] J. Gudmundsson and C. Levcopoulos. A fast approximation algorithm for TSP with neighborhoods. Nordic Journal of Computing, 6(4):469-488, Winter 1999.
16. [GN98] L. Gewali and S. C. Ntafos. Watchman routes in the presence of a pair of convex polygons. Information Sciences, 105(1-4):123-149, 1998.
17. [IhI92] E. Ihler. The complexity of approximating the class Steiner tree problem. In Gunther Schmidt and Rudolf Berghammer, editors, Proceedings on Graph-Theoretic Concepts in Computer Science (WG '91), volume 570 of LNCS, pages 85-96, Berlin, Germany, June 1992. Springer.
18. [LY94] C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. JACM, 41(5):960-981, 1994.
19. [Mit96] J. S. B. Mitchell. Guillotine subdivisions approximate polygonal subdivisions: A simple new method for the geometric k-MST problem. In Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 402-408, Atlanta, Georgia, 28-30 January 1996.
20. [Mit00] J. S. B. Mitchell. Geometric Shortest Paths and Network optimization. Elsevier Science, preliminary edition, 2000.
21. [MM95] C. Mata and J. S. B. Mitchell. Approximation algorithms for geometric tour and network design problems. In Proceedings of the 11th Annual Symposium on Computational Geometry, pages 360-369, New York, NY, USA, June 1995. ACM Press.
22. [NW90] B. J. Nilsson and D. Wood. Optimum watchmen in spiral polygons. In CCCG: Canadian Conference in Computational Geometry, pages 269-272, 1990.
23. [Pap77] C. H. Papadimitriou. Euclidean TSP is NP-complete. Theoretical Computer Science, 4:237-244, 1977.
24. [Pet94] E. Petrank. The hardness of approximation: Gap location. Computational Complexity, 4(2):133-157, 1994.
25. [PV00] C. H. Papadimitriou and S. Vempala. On the approximability of the traveling salesman problem (extended abstract). In ACM, editor, Proceedings of the thirty second annual ACM Symposium on Theory of Computing: Portland, Oregon, May 21-23, [2000], pages 126-133, New York, NY, USA, 2000. ACM Press.
26. [RS97] R. Raz and S.Safra. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pages 475-484. ACM Press, 1997.
27. [Sla97] P. Slavik. The errand scheduling problem. Technical Report 97-02, SUNY at Buffalo, March 14, 1997.
28. [XHHI93] T. Xue-Hou, T. Hirata, and Y. Inagaki. An incremental algorithm for constructing shortest watchman routes. International Journal of Computational Geometry and Applications, 3(4):351-365, 1993.