• Citer

Why some heaps support constant-amortized-time decrease-key operations, and others do not

par Iacono, John ;Özkan, Özgür
Référence Lecture notes in computer science, 8572, page (637-649)
Publication Publié, 2014

Article révisé par les pairs

• Détails
• Contenu

Résumé :

A lower bound is presented which shows that a class of heap algorithms in the pointer model with only heap pointers must spend Ω(log log n/log log log n) amortized time on the Decrease-Key operation (given O(logn) amortized-time Extract-Min). Intuitively, this bound shows the key to having O(1)-time Decrease-Key is the ability to sort O(logn) items in O(logn) time; Fibonacci heaps [M. .L. Fredman and R. E. Tarjan. J. ACM 34(3):596-615 (1987)] do this through the use of bucket sort. Our lower bound also holds no matter how much data is augmented; this is in contrast to the lower bound of Fredman [J. ACM 46(4):473-501 (1999)] who showed a tradeoff between the number of augmented bits and the amortized cost of Decrease-Key. A new heap data structure, the sort heap, is presented. This heap is a simplification of the heap of Elmasry [SODA 2009: 471-476] and shares with it a O(loglogn) amortized-time Decrease-Key, but with a straightforward implementation such that our lower bound holds. Thus a natural model is presented for a pointer-based heap such that the amortized runtime of a self-adjusting structure and amortized lower asymptotic bounds for Decrease-Key differ by but a O(logloglogn) factor. © 2014 Springer-Verlag.