Approximation results for kinetic variants of TSP

Discrete and Computational Geometry

Volumn 27, Issue 4, 2002, Pages 635-651

  Hammar, Mikael ^a   Nilsson, Bengt J ^b  

^a LUND UNIVERSITY   (Sweden)

^b MALMÖ UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035999222     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-001-0081-4     Document Type: Article

References (13)

1. S. Arora. Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In Proc. 37th Annual Symposium on Foundations of Computer Science (FOCS), pages 2-11, 1996.
2. S. Arora. Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. In Proc. 38th Annual Symposium on Foundations of Computer Science (FOCS), pages 554-563, 1997.
3. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and intractability of approximation problems. In Proc. 33rd FOCS, pages 13-22, 1992.
4. P. Chalasani and R. Motwani. Approximating capacitated routing and delivery problems. Technical Report STAN-CS-TN-95-24, Department of Computer Science, Stanford University, Stanford, CA, 1995.
5. P. Chalasani, R. Motwani, and A. Rao. Approximation algorithms for robot grasp and delivery. In Proc. 2nd International Workshop on Algorithmic Foundations of Robotics, pages 347-362, 1996.
6. N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. Technical Report 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA, 1976.
7. M. R. Garey, R. L. Graham, and D. S. Johnson. Some NP-complete geometric problems. In Proc. 8th Annual ACM Symposium on Theory of Computing, pages 10-21, 1976.
8. C. S. Helvig, G. Robins, and A. Zelikovsky. Moving-target TSP and related problems. In Proc. 6th Annual European Symposium on Algorithms (ESA), pages 453-464, 1998.
9. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys. The TRAVELING SALESMAN PROBLEM, A Guided Tour of Combinatorial Optimization. Wiley, New York, 1985.
10. J. S. B. Mitchell. Guillotine subdivisions approximate polygonal subdivisions: Part II - a simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM J. Comput, 28(4): 1298-1309, 1999.
11. C. H. Papadimitriou. Euclidean TSP is NP-complete. Theoret. Comput. Sci., 4:237-244, 1977.
12. S. B. Rao and W. D. Smith. Approximating geometrical graphs via "spanners" and "banyans". In Proc. 13th Annual ACM Symposium on Theory of Computing, pages 540-550, 1998.
13. S. Sahni and T. Gonzales. P-complete approximation problems. J. Assoc. Comput. Mach., 23:555-565, 1976.