Fully-Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time.

Published in: CoRR (2023)

Keyphrases

worst case
upper bound
average case
lower bound
dynamically updated
np hard
error bounds
shortest path
greedy algorithm
closed form
optimal solution
database
approximation algorithms
optimal control
optimal design
information systems
real time