Exploring monotonic priority queues for Dijkstra optimization
<|reference_start|>Exploring monotonic priority queues for Dijkstra optimization: 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.<|reference_end|>
@article{costa2024exploring,
    title={Exploring Monotone Priority Queues for Dijkstra Optimization},
    author={Jonas Costa and Lucas Castro and Rosiane de Freitas},
    journal={arXiv preprint arXiv:2409.06061},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.06061},
    primaryClass={cs.DS}
}