3 papers
cs.DS2025
Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps
Bernhard Haeupler, Richard HladÃk, Václav RozhoÅ +2
In this paper we prove that Dijkstra's shortest-path algorithm, if implemented with a sufficiently efficient heap, is universally optimal in its running time, and with suitable sma…
cs.DS2025
Faster All-Pairs Optimal Electric Car Routing
Dani Dorfman, Haim Kaplan, Robert E. Tarjan +2
We present a randomized -time algorithm for computing \emph{optimal energetic paths} for an electric car between all pairs of vertices in an -vertex directed…
cs.DS2025
Efficiency of Self-Adjusting Heaps
Corwin Sinnamon, Robert E. Tarjan
Since the invention of the pairing heap by Fredman, Sedgewick, Sleator, and Tarjan, it has been an open question whether this or any other simple "self-adjusting" heap supports dec…