Faster Deterministic Worst-Case Fully Dynamic All-Pairs Shortest Paths via Decremental Hop-Restricted Shortest Paths.

Shiri Chechik Tianyi Zhang

Published in: SODA (2023)

Keyphrases

shortest path
worst case
shortest path problem
shortest path algorithm
road network
routing algorithm
path length
dynamic environments
np hard
sliding window
weighted graph
optimal path
flow graph
upper bound
travel time
approximation algorithms
minimal surface
minimum length
lower bound
computational complexity