On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees

Algorithmica (New York)

Volumn 19, Issue 4, 1997, Pages 447-460

  Das, G ^a   Kapoor, S ^b   Smid, M ^c  

^a University of Memphis   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^c KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

Computational geometry; Lower bounds; Minimum spanning trees; Traveling salesman problem

Indexed keywords

EID: 0004859885     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/pl00009183     Document Type: Article

References (11)

1. P.K. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete & Computational Geometry 6 (1991), 407-422.
2. S. Arora. Polynomial time approximation schemes for Euclidean TSP and other geometric problems. Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, 1996, pp. 2-11.
3. M. Ben-Or. Lower bounds for algebraic computation trees. Proceedings of the 15th Annual ACM Symposium on the Theory of Computing, 1983, pp. 80-86.
4. M.W. Bern, H.J. Karloff, P. Raghavan, and B. Schieber. Fast geometric approximation techniques and geometric embedding problems. Proceedings of the 5th Annual ACM Symposium on Computational Geometry, 1989, pp. 292-301.
5. P.B. Callahan and S.R. Kosaraju. Faster algorithms for some geometric graph problems in higher dimensions. Proceedings of the 4th Annual Symposium on Discrete Algorithms, 1993, pp. 291-300.
6. N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. Report 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA, 1976.
7. J.H. van Lint and R.M. Wilson. A Course in Combinatorics. Cambridge University Press, Cambridge, 1992.
8. C.H. Papadimitriou. The Euclidean traveling salesman problem is NP-complete. Theoretical Computer Science 4 (1977), 237-244.
9. F.P. Preparata and M.I. Shamos. Computational Geometry, an Introduction. Springer-Verlag, New York, 1985.
10. J.S. Salowe. Constructing multidimensional spanner graphs. International Journal of Computational Geometry and Applications 1 (1991), 99-107.
11. P.M. Vaidya. Minimum spanning trees in k-dimensional space. SIAM Journal on Computing 17 (1988), 572-582.