Approximation results for kinetic variants of TSP

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

Volumn 1644 LNCS, Issue , 1999, Pages 392-401

  Hammar, Mikael ^a   Nilsson, Bengt J ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; KINETICS; TRAVELING SALESMAN PROBLEM;

APPROXIMATION COMPLEXITY; APPROXIMATION RESULTS; CONSTANT SPEED; MAXIMUM VELOCITY; POINT MOVES; POLYNOMIAL TIME APPROXIMATION SCHEMES; POLYNOMIAL-TIME ALGORITHMS;

POLYNOMIAL APPROXIMATION;

EID: 84887466960     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_36     Document Type: Conference Paper

References (9)

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. Polynomial time approximation schemes for Euclidean TSP and other geometric problems. Manuscript, 1997.
3. P. Chalasani and R. Motwani. Approximating capacitated routing and delivery problems. Technical Report STAN-CS-TN-95-24, Department of Computer Science, Stanford University, 1995.
4. P. Chalasani, R. Motwani, and A. Rao. Approximation algorithms for robot grasp and delivery. In Proceedings of the 2nd International Workshop on Algorithmic Foundations of Robotics, pages 347-362, 1996.
5. 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.
6. C. S. Helvig, G. Robins, and A. Zelikovsky. Moving-target TSP and related problems. In Proc. 6th Annual European Symposium on Algorithms (ESA), 1998.
7. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys. The TRA- VELING SALESMAN PROBLEM, A Guided Tour of Combinatorial Optimization. John Wiley & Sons Ltd., 1985.
8. 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. To appear in SIAM J. Computing.
9. S. B. Rao and W. D. Smith. Approximating geometrical graphs via spanners and banyans. In STOC, pages 540-550, 1998.