Approximating the complete Euclidean graph
- 1 January 1988
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 208-213
- https://doi.org/10.1007/3-540-19487-8_23
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- Delaunay graphs are almost as good as complete graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Shortest paths in euclidean graphsAlgorithmica, 1986
- There is a planar graph almost as good as the complete graphPublished by Association for Computing Machinery (ACM) ,1986