Approximating the complete Euclidean graph

  • J. Mark Keil
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 318)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [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. [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. [3]
    Sedgewick, R. and J. Vitter, Shortest paths in Euclidean graphs, Algorithmica, 1,1(1986), 31–48.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • J. Mark Keil
    • 1
  1. 1.Department of Computational ScienceUniversity of SaskatchewanSaskatoonCanada

Personalised recommendations