Simpler universally optimal Dijkstra

DOI10.4230/LIPICS.ESA.2025.71MaRDI QIDQ7322477zbMATH OpenFDO

Authors Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann

Publication date 31 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2025.71

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A note on two problems in connexion with graphs
• Bidirectional Dijkstra's algorithm is instance-optimal
• Fast and simple sorting using partial information
• Fibonacci heaps and their uses in improved network optimization algorithms
• scientific article; zbMATH DE number 1617246 (Why is no real title available?)
• Simpler optimal sorting from a directed acyclic graph
• Sorting under partial information (without the ellipsoid algorithm)
• Surpassing the information theoretic bound with fusion trees
• Universal optimality of Dijkstra via beyond-worst-case heaps
• Universally-optimal distributed algorithms for known topologies

This page was built for publication: Simpler universally optimal Dijkstra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7322477)