Buckets, Heaps, Lists, and Monotone Priority Queues

Authors:
Boris V. Cherkassky;Andrew V. Goldberg;Craig Silverstein
Affiliations:
-;-;-
Venue:
SIAM Journal on Computing
Year:
1999

Citing 0
Cited 14

Faster kinetic heaps and their use in broadcast scheduling

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
An experimental study of priority queues in external memory

Journal of Experimental Algorithmics (JEA)
Improved Shortest Paths on the Word RAM

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Shortest Path Algorithms: Engineering Aspects

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
A Simple Shortest Path Algorithm with Linear Average Time

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Exact and Approximate Distances in Graphs - A Survey

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Integer priority queues with decrease key in constant time and the single source shortest paths problem

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Meldable RAM priority queues and minimum directed spanning trees

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Concepts of exact QoS routing algorithms

IEEE/ACM Transactions on Networking (TON)
Integer priority queues with decrease key in constant time and the single source shortest paths problem

Journal of Computer and System Sciences - Special issue: STOC 2003
Black box for constant-time insertion in priority queues (note)

ACM Transactions on Algorithms (TALG)
Finding shortest paths on real road networks: the case for A*

International Journal of Geographical Information Science
Accelerating the neighbor-joining algorithm using the adaptive bucket data structure

ISBRA'08 Proceedings of the 4th international conference on Bioinformatics research and applications
Nondecreasing paths in a weighted graph or: How to optimally read a train schedule

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the heap-on-top (hot) priority queue data structure that combines the multilevel bucket data structure of Denardo and Fox with a heap. Our data structure has superior operation bounds than either structure taken alone. We use the new data structure to obtain an improved bound for Dijkstra's shortest path algorithm. We also discuss a practical implementation of hot queues. Our experimental results in the context of Dijkstra's algorithm show that this implementation of hot queues performs very well and is more robust than implementations based only on heap or multilevel bucket data structures.