Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds.
Maximilian Probst GutenbergChristian Wulff-NilsenPublished in: SODA (2020)
Keyphrases
- worst case
- upper bound
- lower bound
- average case
- error bounds
- worst case analysis
- np hard
- mistake bound
- space complexity
- greedy algorithm
- worst case scenario
- running times
- improved algorithm
- approximation algorithms
- dynamic environments
- low dimensional
- higher dimensional
- upper and lower bounds
- search space
- computational complexity
- data structure
- constant factor
- case study
- real time