Approximation algorithms for Euclidean group TSP

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 1115-1126

  Elbassioni, Khaled ^a   Fishkin, Aleksei V ^a   Mustafa, Nabil H ^a   Sitters, René ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PROBLEM SOLVING; TREES (MATHEMATICS);

APPROXIMATION ALGORITHMS; EUCLIDEAN GROUP;

COMPUTER SCIENCE;

EID: 26444564642     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_90     Document Type: Conference Paper

References (17)

1. [AH94] E. M. Arkin and R. Hassin. Approximation algorithms for the geometric covering salesman problem. Discrete Applied Mathematics, 55(3):197-218, 1994.
2. [Aro98] S. Arora. Nearly linear time approximation schemes for euclidean TSP and other geometric problems. J. ACM, 45(5):1-30, 1998.
3. [Chr76] N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. Technical report, GSIA, Carnegie-Mellon University, 1976.
4. +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 Proceedings 10th Annual European Symposium on algorithms (ESA), pages 187-199, 2002.
5. [DM03] A. Dumitrescu and J.S.B. Mitchell. Approximation algorithms for TSP with neighborhoods in the plane. J. Algorithms, 48(1):135-159, 2003.
6. [GGJ76] M. R. Garey, R. L. Graham, and D. S. Johnson. Some NP-complete geometric problems. In Proceedings 8th Annual ACM Symposium on the Theory of Computing (STOC), 1976.
7. [GKR00] N. Garg, G. Konjevod, and R. Ravi. A polylogarithmic approximation algorithm for the Group Steiner Tree Problem. J. Algorithms, 37(1):6684, 2000.
8. [GL00] J. Gudmundsson and C. Levcopoulos. Hardness result for TSP with neighborhoods, 2000. Technical Report LU-CS-TR:2000-216, Department of Computer Science, Lund University, Sweden.
9. [Mit99] J.S.B. Mitchell. Guillotine subdivions approximate polygonal subdivisons: A simple polynomial-time approximation scheme for geometric TSP, k-MST and related problems. SICOMP, 28(4):1298-1309, 1999.
10. [Mit00] J.S.B. Mitchel. Handbook of Computational Geometry, chapter Geometric shortest paths and network optimization, pages 633-701. Elsevier, North-Holland, Amsterdam, 2000.
11. [MM95] C.S. Mata arid J.S.B. Mitchell. Approximation algorithms for geometric tour and network design problems (extended abstract). In Proceedings 11th Ann. ACM Symposium on Computational Geometry, pages 360-369, 1995.
12. [Pap77] C. H. Papadimitriou. The Euclidean traveling salesman problem is NP-complete. Theoretical Computer Science, 4(3):237-244, 1977.
13. [RW90] G. Reich and P. Widmayer. Beyond steiner's problem: a VLSI oriented generalization. In WG '89: Proceedings of the fifteenth international workshop on Graph-theoretic concepts in computer science, pages 196-210. Springer-Verlag New York, Inc., 1990.
14. [Sla96] Petr Slavik. A tight analysis of the greedy algorithm for set cover. In STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pages 435-441, 1996.
15. [Sla97] P. Slavik. The errand scheduling problem. Technical report, March 14 1997. Technical Report, SUNY, Buffalo, USA.
16. [SS03] S. Safra and O. Schwartz. On the complexity of approximating TSP with Neighborhoods and related problems. In Proceedings 11th Annual European Symposium on algorithms (ESA), volume 2832 of Lecture Notes in Computer Science, pages 446-458. Springer, 2003.
17. [Sta94] A. F. van der Stappen. Motion Planning amidst Fat Obstacles. Ph.d. dissertation, Utrecht University, Utrecht, Netherlands, 1994.