Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon.
Dima BuragoDima GrigorievAnatol SlissenkoPublished in: Theor. Comput. Sci. (2004)
Keyphrases
- shortest path
- shortest path problem
- road network
- shortest path algorithm
- routing algorithm
- travel time
- path length
- flow graph
- finding the shortest path
- optimal path
- minimal surface
- geodesic distance
- weighted graph
- path selection
- line segments
- dijkstra algorithm
- worst case
- minimum spanning tree
- path queries
- minimum cost flow
- strongly connected components