https://hackerpaper.kaipfister.de/p/2311.11793/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=41948823urn:hackerpapers:mention:2311.11793:41948823Fri, 25 Oct 2024 19:34:08 GMT<p>&quot;Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps&quot; (2024) https://arxiv.org/abs/2311.11793 : &gt; Abstract: This paper proves that Dijkstra&#x27;s shortest-path algorithm is universally optimal in both its running time and number of comparisons when combined with a sufficiently efficient heap data structure. Dijkstra&#x27;s algorithm: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm NetworkX docs &gt; Reference &gt; Algorithms &gt; Shortest Paths: https://networkx.org/documentation/stable/reference/algorith... networkX.algorithms.shortest_path.dijkstra_path…</p><p><a href="https://hackerpaper.kaipfister.de/p/2311.11793/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DShttps://news.ycombinator.com/item?id=41947355urn:hackerpapers:submission:2311.11793:41947355Fri, 25 Oct 2024 17:19:12 GMT<p>Universal optimality of Dijkstra via beyond-worst-case heaps</p><p></p><p>203 points; 47 discussion replies on HN. <a href="https://hackerpaper.kaipfister.de/p/2311.11793/">Paper and source history</a>. A submission is not an endorsement.</p>cs.DS