Violation heaps: A better substitute for Fibonacci heaps

DMCA

Violation heaps: A better substitute for Fibonacci heaps (2008)

Cached

Other Repositories/Bibliography

DBLP

Save to List
Add to Collection
Correct Errors
Monitor Changes

by Amr Elmasry

Citations:

3 - 0 self

BibTeX

@MISC{Elmasry08violationheaps:,
    author = {Amr Elmasry},
    title = {Violation heaps: A better substitute for Fibonacci heaps},
    year = {2008}
}

OpenURL

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 a more efficient practical behavior compared to any other known Fibonacci-like heap.

Keyphrases

fibonacci heap violation heap priority queue amortized bound efficient practical behavior fibonacci-like heap worst-case time decrease-key require

DMCA