Skip to main content
SpringerLink
Log in

Approximating the complete Euclidean graph

  • Conference paper
  • First Online:
SWAT 88 (SWAT 1988)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chew, P., There is a planar graph almost as good as the complete graph, Proceedings of the 2nd Symposium on Computational Geometry, Yorktown Heights NY, 1986, 169–177.

    Google Scholar 

  2. Dobkin, D., S. Friedman and K. Supowit, Delaunay Graphs are Almost as Good as Complete Graphs, Proceedings of the 28th Annual Symposium on Foundations of Computing, Los Angeles Ca., 1987, 20–26.

    Google Scholar 

  3. Sedgewick, R. and J. Vitter, Shortest paths in Euclidean graphs, Algorithmica, 1,1(1986), 31–48.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computational Science, University of Saskatchewan, S7N 0W0, Saskatoon, Canada

    J. Mark Keil

Authors
  1. J. Mark Keil
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rolf Karlsson Andrzej Lingas

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Keil, J.M. (1988). Approximating the complete Euclidean graph. In: Karlsson, R., Lingas, A. (eds) SWAT 88. SWAT 1988. Lecture Notes in Computer Science, vol 318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19487-8_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-19487-8_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19487-3

  • Online ISBN: 978-3-540-39288-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation