Login / Signup
On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs.
Ittai Abraham
Shiri Chechik
Daniel Delling
Andrew V. Goldberg
Renato F. Werneck
Published in:
SODA (2016)
Keyphrases
</>
shortest path
worst case
planar graphs
shortest path algorithm
road network
lower bound
upper bound
weighted graph
travel time
finding the shortest path
greedy algorithm
np hard
closed form