Skip to main content

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

  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1180))

  • 160 Accesses

Abstract

We consider the problems of computing r-approximate traveling salesman tours and r-approximate minimum spanning trees for a set of n points in ℝd, where d≥ 1 is a constant. In the algebraic computation tree model, the complexities of both these problems are shown to be θ(nlog(n/r)), for all n and r such that r<n and r is larger than some constant. In the more powerful model of computation that additionally uses the floor function and random access, both problems can be solved in O(n) time if r=θ(n 1−1/d).

Part of this work was done while the authors were at the Max-Planck-Institut für Informatik, Saarbrücken.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. P.K. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete & Computational Geometry 6 (1991), pp. 407–422.

    Google Scholar 

  2. S. Arora. Polynomial time approximation schemes for Euclidean TSP and other geometric problems. Proc. 37th Annual IEEE Symposium on Foundations of Computer Science, 1996, to appear.

    Google Scholar 

  3. M. Ben-Or. Lower bounds for algebraic computation trees. Proceedings 15th Annual ACM Symposium on the Theory of Computing, 1983, pp. 80–86.

    Google Scholar 

  4. M.W. Bern, H.J. Karloff, P. Raghavan, and B. Schieber. Fast geometric approximation techniques and geometric embedding problems. Proceedings 5th Annual ACM Symposium on Computational Geometry, 1989, pp. 292–301.

    Google Scholar 

  5. P.B. Callahan and S.R. Kosaraju. Faster algorithms for some geometric graph problems in higher dimensions. Proceedings 4th Annual Symposium on Discrete Algorithms, 1993, pp. 291–300.

    Google Scholar 

  6. N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. Report 388, Grad School of Industrial Administration, CMU, 1976.

    Google Scholar 

  7. J.H. van Lint and R.M. Wilson. A Course in Combinatorics. Cambridge University Press, 1992.

    Google Scholar 

  8. C.H. Papadimitriou. The Euclidean traveling salesman problem is NP-complete. Theoretical Computer Science 4 (1977), pp. 237–244.

    Google Scholar 

  9. F.P. Preparata and M.I. Shamos. Computational Geometry, an Introduction. Springer-Verlag, New York, 1985.

    Google Scholar 

  10. J.S. Salowe. Constructing multidimensional spanner graphs. International Journal of Computational Geometry and Applications 1 (1991), pp. 99–107.

    Google Scholar 

  11. P.M. Vaidya. Minimum spanning trees in k-dimensional space. SIAM Journal on Computing 17 (1988), pp. 572–582.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

V. Chandru V. Vinay

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Das, G., Kapoor, S., Smid, M. (1996). On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees. In: Chandru, V., Vinay, V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1996. Lecture Notes in Computer Science, vol 1180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62034-6_38

Download citation

  • DOI: https://doi.org/10.1007/3-540-62034-6_38

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62034-1

  • Online ISBN: 978-3-540-49631-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics