Approximating geometric bottleneck shortest paths
- 30 November 2004
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 29 (3), 233-249
- https://doi.org/10.1016/j.comgeo.2004.04.003
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Classes of graphs which approximate the complete euclidean graphDiscrete & Computational Geometry, 1992
- An optimal algorithm for constructing oriented voronoi diagrams and geographic neighborhood graphsInformation Processing Letters, 1990
- On Finding Lowest Common Ancestors: Simplification and ParallelizationSIAM Journal on Computing, 1988
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related ProblemsSIAM Journal on Computing, 1982