Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds.
Maximilian Probst GutenbergChristian Wulff-NilsenPublished in: CoRR (2020)
Keyphrases
- worst case
- upper bound
- lower bound
- average case
- error bounds
- np hard
- search space
- low dimensional
- worst case analysis
- shortest path
- dynamically changing
- theoretical guarantees
- sample size
- mistake bound
- running times
- complexity bounds
- space requirements
- data mining
- confidence bounds
- upper and lower bounds
- approximation algorithms
- greedy algorithm
- space time
- dimensionality reduction
- reinforcement learning
- search engine