Approximation algorithms for TSP with neighborhoods in the plane

Journal of Algorithms

Volumn 48, Issue 1, 2003, Pages 135-159

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

^a UNIVERSITY OF WISCONSIN MILWAUKEE   (United States)

^b STONY BROOK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; LINEAR PROGRAMMING; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

EUCLIDEAN PLANE;

TRAVELING SALESMAN PROBLEM;

EID: 0042880653     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(03)00047-6     Document Type: Conference Paper

References (26)

1. E.M. Arkin, R. Hassin, Approximation algorithms for the geometric covering salesman problem, Discrete Appl. Math. 55 (1994) 197-218.
2. S. Arora, Nearly linear time approximation schemes for Euclidean TSP and other geometric problems,J. ACM 45 (5) (1998) 1-30.
3. T. Asano, S.K. Ghosh, T.C. Shermer, Visibility in the plane, in: J.-R. Sack, J. Urrutia (Eds.), Handbook of Computational Geometry, Elsevier, North-Holland, Amsterdam, 2000, pp. 829-876.
4. J.L. Bentley, Fast algorithms for geometric traveling salesman problems, ORSA J. Comput. 4 (4) (1992) 387-411.
5. M. de Berg, J. Gudmundsson, M.J. Katz, C. Levcopoulos, M.H. Overmars, A.F. van der Stappen, TSP with neighborhoods of varying size, in: Proc. 10th Annual European Symposium on Algorithms, September, 2002, pp. 187-199.
6. O. Bottema, R.Ž. Djordjevié, R. Janić, D.S. Mitrinović, P.M. Vasić. Geometric Inequalities, Wolters- Noordhoff, Groningen, 1969.
7. P. Berman, M. Karpinski, On some tighter inapproximability results, Technical Report TR98-065, ECCC, 1998.
8. S. Carlsson, H. Jonsson, B.J. Nilsson, Finding the shortest watchman route in a simple polygon, Discrete Comput. Geom. 22 (3) (1999) 377-402.
9. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, NY, 1979.
10. J. Gudmundsson, C. Levcopoulos, A fast approximation algorithm for TSP with neighborhoods, Nordic J. Comput. 6 (1999) 469-488.
11. J. Gudmundsson, C. Levcopoulos, Hardness result for TSP with neighborhoods, Technical Report LU-CS- TR:2000-216, Department of Computer Science, Lund University, Sweden, 2000.
12. H. Jonsson. The traveling salesman problem for lines in the plane. Inform. Process. Lett. 82 (3) (2002) 137-142.
13. M. Jünger. G. Reinelt, G. Rinaldi, The traveling salesman problem, in: M.O. Ball, T.L. Magnanti, C.L. Monma, G.L. Nemhauser (Eds.), Network Models, Handbook of Operations Research/Management Science, Elsevier, Amsterdam, 1995, pp. 225-330.
14. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (Eds.), The Traveling Salesman Problem, Wiley, New York, NY, 1985.
15. C. Mata, J.S.B. Mitchell, Approximation algorithms for geometric tour and network design problems, in: Proc. 11th Annu. ACM Sympos. Comput. Geom., 1995, pp. 360-369.
16. N. Megiddo, Linear programming in linear time when the dimension is fixed, J. ACM 31 (1984) 114-127.
17. J.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) (1999) 1298-1309.
18. J.S.B. Mitchell, Guillotine subdivisions approximate polygonal subdivisions: Part III. Faster polynomial-time approximation schemes for geometric network optimization, Manuscript, University at Stony Brook, 1997.
19. J.S.B. Mitchell, Approximation algorithms for geometric optimization problems, in: Proc. Ninth Canadian Conference on Computational Geometry, Queen'S University, Kingston, Canada, August 11-14, 1997, pp. 229-232.
20. J.S.B. Mitchell, Geometric shortest paths and network optimization, in: J.-R. Sack, J. Urrutia (Eds.), Handbook of Computational Geometry, Elsevier, North-Holland, Amsterdam, 2000, pp. 633-701.
21. C.H. Papadimitriou, The Euclidean traveling salesman problem is NP-complete, Theoret. Comput. Sci. 4 (1977) 237-244.
22. H. Rademacher, O. Toeplitz, The Enjoyment of Mathematics. Princeton Univ. Press, 1957, a translation from Von Zahlen und Figuren, Springer, Berlin, 1933.
23. S.B. Rao, W.D. Smith, Approximating geometrical graphs via "spanners" and "banyans", in: Proc. 30th Annu. ACM Sympos. Theory Comput., 1998, pp. 540-550.
24. G. Reinelt, Fast heuristics for large geometric traveling salesman problems, ORSA J. Comput. 4 (1992) 206-217.
25. O. Schwartz, S. Safra, On the complexity of approximating TSP with neighborhoods and related problems, Manuscript, July 2002, submitted.
26. X. Tan, Fast computation of shortest watchman routes in simple polygons, Inform. Process. Lett. 77 (1) (2001)27-33.