Universal optimality of dijkstra via beyond-worst-case heaps
B Haeupler, R Hladík, V Rozhoň… - 2024 IEEE 65th …, 2024 - ieeexplore.ieee.org
This paper proves that Dijkstra's shortest-path algorithm is universally optimal in both its
running time and number of comparisons when combined with a sufficiently efficient heap …
running time and number of comparisons when combined with a sufficiently efficient heap …
Simpler Optimal Sorting from a Directed Acyclic Graph
I van der Hoog, E Rotenberg, D Rutschmann - arXiv preprint arXiv …, 2024 - arxiv.org
Fredman proposed in 1976 the following algorithmic problem: Given are a ground set $ X $,
some partial order $ P $ over $ X $, and some comparison oracle $ O_L $ that specifies a …
some partial order $ P $ over $ X $, and some comparison oracle $ O_L $ that specifies a …
Bidirectional Dijkstra's Algorithm is Instance-Optimal
While Dijkstra's algorithm has near-optimal time complexity for the problem of finding the
shortest $ st $-path, in practice, other algorithms are often superior on huge graphs. A …
shortest $ st $-path, in practice, other algorithms are often superior on huge graphs. A …
[PDF][PDF] Optimizing Heap Sort for Repeated Values: A Modified Approach to Improve Efficiency in Duplicate-Heavy Data Sets
JK Wiredu, I Aabaah… - International Journal of …, 2024 - researchgate.net
Sorting algorithms are critical to various computer science applications, including database
management, big data analytics, and real-time systems. While Heap Sort is a widely used …
management, big data analytics, and real-time systems. While Heap Sort is a widely used …
Fast and Simple Sorting Using Partial Information
R Hladík - 2024 - research-collection.ethz.ch
We consider the problem of sorting n totally ordered items by doing binary comparisons,
given a list of m comparisons that have already been performed. This problem has been …
given a list of m comparisons that have already been performed. This problem has been …