Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time.

Jan van den Brand Danupon Nanongkai

Published in: FOCS (2019)

Keyphrases

shortest path
worst case
shortest path algorithm
shortest path problem
finding the shortest path
routing algorithm
weighted graph
lower bound
dynamic environments
road network
travel time
geodesic distance
social network analysis
optimal path
upper bound
minimum cost flow
np hard