A Single-Exponential Upper Bound for Finding Shortest Paths in Three Dimensions.
John H. ReifJames A. StorerPublished in: J. ACM (1994)
Keyphrases
- shortest path
- upper bound
- lower bound
- shortest path algorithm
- shortest path problem
- road network
- weighted graph
- finding the shortest path
- strongly connected components
- minimum cost flow
- optimal path
- geodesic distance
- path length
- spatial networks
- branch and bound algorithm
- flow graph
- worst case
- routing algorithm
- minimal surface
- state space
- social networks