Year: 2024
Type: preprint
Abstract: This paper presents a comprehensive overview of monotone priority queues, focusing on their evolution and application in shortest path algorithms. Monotone priority queues are characterized by the property that their minimum key does not decrease over time, making them particularly effective for label-setting algorithms like Dijkstra's. Some key data structures within this category are explored, emphasizing those derived directly from Dial's algorithm, including variations of multi-level bucket structures and radix heaps. Theoretical complexities and practical considerations of these structures are discussed, with insights into their development and refinement provided through a historical timeline.
Source: arXiv (Cornell University)
Authors: Costa, Jonas, Castro, Lucas, de Freitas, Rosiane
Institution: Universidade Federal do Amazonas
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Award: G5578022071
OpenAlex ID: W4403576217