Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps.
Bernhard HaeuplerRichard HladíkVáclav RozhonRobert E. TarjanJakub TetekPublished in: CoRR (2023)
Keyphrases
- worst case
- lower bound
- average case
- greedy algorithm
- upper bound
- np hard
- approximation algorithms
- optimal solution
- error bounds
- neural network
- worst case analysis
- computational complexity
- mistake bound
- sequence prediction
- theoretical analysis
- special case
- space complexity
- information systems
- data sets
- asymptotic optimality
- algorithmic information theory
- worst case scenario