Worst case length of nearest neighbor tours for the Euclidean traveling salesman problem

SIAM Journal on Discrete Mathematics

Volumn 10, Issue 2, 1997, Pages 171-179

  Tassiulas, L ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Euclidean traveling salesman problem; Nearest neighbor tours; Worst case analysis

Indexed keywords

EID: 3943108832     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480194278246     Document Type: Article

References (12)

1. J. H. CONWAY AND N. J. A. SLOANE, Sphere Packings Lattices and Groups, Springer-Verlag, New York, Berlin, 1993.
2. T.H. CORMAN, C.E. LEISERSON, AND R.L. RIVEST, Introduction to Algorithms, McGraw-Hill, New York, 1990.
3. L. FEW, The shortest path and the shortest road through n points in a region, Mathematika, 2 (1955), pp. 141-144.
4. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
5. D. S. JOHNSON AND C. H. PAPADIMITRIOU, Performance guarantees for heuristics, in The Traveling Salesman Problem: A Guided Tour in Combinatorial Optimization, E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, eds., John Wiley, New York, 1985, pp. 145-180.
6. H. KARLOFF, How long can a Euclidean traveling salesman tour be? SIAM J. Discrete Math., 2 (1989), pp. 91-99.
7. R. M. KARP, Reducibility among combinatorial problems, in Complexity of Computer Computations, R. E. Miller and J. W. Thacher, eds., Plenum, New York, 1972, pp. 85-103.
8. E. L. LAWLER, J. K. LENSTRA, A. H. G. RINNOOY KAN, AND D. B. SHMOYS, EDS., The Travelling Salesman Problem, John Wiley, New York, 1985.
9. S. MORAN, On the length of optimal TSP circuits in sets of bounded diameter, J. Combin. Theory Ser. B, 37 (1984), pp. 113-141.
10. C. H. PAPADIMITRIOU, The Euclidean traveling salesman problem is NP-complete, Theoret. Computer Sci., 4 (1977), pp. 237-244.
11. J. M. STEELE, Probabilistic and worst case analyses of classical problems of combinatorial optimization in Euclidean space, Math. Oper. Res., 15(4) (1990), pp. 749-770.
12. K. J. SUPOWIT, E. M. REINGOLD, AND D. A. PLAISTED, The traveling salesman problem and minimum matching in the unit square, SIAM J. Comput., 12 (1983), pp. 144-156.