Login / Signup
On the Complexity of Time-Dependent Shortest Paths.
Luca Foschini
John Hershberger
Subhash Suri
Published in:
SODA (2011)
Keyphrases
</>
shortest path
travel time
shortest path algorithm
road network
shortest path problem
geodesic distance
path length
computational complexity
finding the shortest path
routing algorithm
minimal surface
objective function
optimal path
spatial networks
minimum cost flow