The violation heap: a relaxed Fibonacci-like heap

Authors:
Amr Elmasry
Affiliations:
Max-Planck Institut für Informatik, Saarbrücken, Germany
Venue:
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Year:
2010

Citing 17
Cited 2

Self-adjusting binary search trees

Journal of the ACM (JACM)
The pairing heap: a new form of self-adjusting heap

Algorithmica
Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation

Communications of the ACM
Pairing heaps: experiments and analysis

Communications of the ACM
Worst-case efficient priority queues

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
On the efficiency of pairing heaps and related data structures

Journal of the ACM (JACM)
A data structure for manipulating priority queues

Communications of the ACM
Meldable heaps and boolean union-find

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Introduction to Algorithms

Introduction to Algorithms
Theory of 2-3 heaps

Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Improved Upper Bounds for Pairing Heaps

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
A general technique for implementation of efficient priority queues

ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Towards a Final Analysis of Pairing Heaps

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Thin heaps, thick heaps

ACM Transactions on Algorithms (TALG)
Two-tier relaxed heaps

Acta Informatica
Pairing heaps with O(log log n) decrease cost

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms

Strict fibonacci heaps

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Rank-Pairing Heaps

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a priority queue that achieves the same amortized bounds as Fibonacci heaps. Namely, find-min requires O(1) worst-case time, insert, meld and decrease-key require O(1) amortized time, and delete-min requires O(log n) amortized time. Our structure is simple and promises an efficient practical behavior when compared to other known Fibonacci-like heaps. The main idea behind our construction is to propagate rank updates instead of performing cascaded cuts following a decrease-key operation, allowing for a relaxed structure.