We introduce a framework for reducing the number of comparisons performed in the deletion and minimum deletion operations for priority queues. In particular, we give a priority queue with constant cost per insertion and minimum finding, and logarithmic cost with at most log n + O(log log n)1 comparisons per deletion and minimum deletion, improving over the bound of 2 log n + O(1) comparisons for the binomial queues and the pairing heaps. We also give a priority queue that supports, in addition to the above operations, the decrease-key operation. This latter priority queue achieves, in the amortized sense, constant cost per insertion, minimum finding and decrease-key operations, and logarithmic cost with at most 1.44 log n + O(log log n) comparisons per deletion and minimum deletion. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Elmasry, A. (2004). Layered heaps. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3111, 212–222. https://doi.org/10.1007/978-3-540-27810-8_19
Mendeley helps you to discover research relevant for your work.