An APSP algorithm using detour-vertex predictions achieves O(n^{2.83} + ηn) time by adapting a co-nondeterministic Exact Triangle algorithm to recover from prediction mistakes.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Warm-Starting All-Pairs Shortest Paths with Predictions
An APSP algorithm using detour-vertex predictions achieves O(n^{2.83} + ηn) time by adapting a co-nondeterministic Exact Triangle algorithm to recover from prediction mistakes.