Approximation algorithms for TSP with neighborhoods in the plane

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 38-46

  Dumitrescu, Adrian ^a   Mitchell, Joseph S B ^a  

^a Stony Brook University   (United States)

Author keywords

Adaptive meshing; Algorithms; Computational geometry; Deformation; Differential geometry; Metamorphoses; Proofs

Indexed keywords

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

References (19)

1. Esther M. Arkin , Refael Hassin, Approximation algorithms for the geometric covering salesman problem, Discrete Applied Mathematics, v.55 n.3, p.197-218, Dec. 13, 1994 [doi〉10.1016/0166-218X(94)90008-6]
2. Sanjeev Arora, Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems, Journal of the ACM (JACM), v.45 n.5, p.753-782, Sept. 1998 [doi〉10.1145/290179.290180]
3. J. L. Bentley. Fast algorithms for geometric traveling salesman problems. ORSA J. Comput., 4(4):387-411, 1992.
4. O. Bottema, R. Z. Djordjevid, R. Janid, D. S. Mitrinovid, and P. M. Vasid. Geometric Inequalities. Wolters-Noordhoff, Groningen, 1969.
5. Svante Carlsson , Håkan Jonsson , Bengt J. Nilsson, Finding the Shortest Watchman Route in a Simple Polygon, Proceedings of the 4th International Symposium on Algorithms and Computation, p.58-67, December 15-17, 1993
6. Michael R. Garey , David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, NY, 1979
7. Joachim Gudmundsson , Christos Levcopoulos, A fast approximation algorithm for TSP with neighborhoods, Nordic Journal of Computing, v.6 n.4, p.469-488, Winter 1999
8. J. Gudmundsson and C. Levcopoulos. Hardness result for TSP with neighborhoods. Technical Report LU-CS- TR:2000-216, Department of Computer Science, Lund University, Sweden, 2000.
9. M. Jfinger, G. Reinelt, and G. Rinaldi. The traveling salesman problem. In M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, editors, Network Models, Handbook of Operations Research/Management Science, pages 225-330. Elsevier Science, Amsterdam, 1995.
10. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, editors. The Traveling Salesman Problem. John Wiley & Sons, New York, NY, 1985.
11. Cristian S. Mata , Joseph S. B. Mitchell, Approximation algorithms for geometric tour and network design problems (extended abstract), Proceedings of the eleventh annual symposium on Computational geometry, p.360-369, June 05-07, 1995, Vancouver, British Columbia, Canada [doi̊10.1145/220279.220318]
12. Nimrod Megiddo, Linear Programming in Linear Time When the Dimension Is Fixed, Journal of the ACM (JACM), v.31 n.1, p.114-127, Jan. 1984 [doi>10.1145/2422.322418]
13. Joseph 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, v.28 n.4, p.1298-1309, Aug. 1999 [doi̊10.1137/S0097539796309764]
14. J. S. B. Mitchell. Geometric shortest paths and network optimization. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 633- 701. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000.
15. B. J. Nilsson. Guarding Art Galleries - Methods for Mobile Guards. PhD thesis, Lund University, 1995.
16. C. H. Papadimitriou. The Euclidean traveling salesman problem is NP-complete. Theoret. Comput. Sci., 4:237-244, 1977.
17. S. B. Rao and W. D. Smith. Improved approximation schemes for traveling salesman tours. In Proe. 30th Annu. ACM Sympos. Theory Comput., 1998.
18. G. Reinelt. Fast heuristics for large geometric traveling salesman problems. ORSA J. Comput., 4:206-217, 1992.
19. X. Tan, T. Hirata, and Y. Inagaki. Corrigendum to 'An incremental algorithm for constructing shortest watchman routes'. Manuscript (submitted to internat. j. comput, geom. appl.), Tokai University, Japan, 1998.