skip to main content
research-article

Hollow Heaps

Published: 27 July 2017 Publication History

Abstract

We introduce the hollow heap, a very simple data structure with the same amortized efficiency as the classical Fibonacci heap. All heap operations except delete and delete-min take O(1) time, worst case as well as amortized; delete and delete-min take O(log n) amortized time on a heap of n items. Hollow heaps are the simplest structure to achieve these bounds. Hollow heaps combine two novel ideas: the use of lazy deletion and re-insertion to do decrease-key operations and the use of a dag (directed acyclic graph) instead of a tree or set of trees to represent a heap. Lazy deletion produces hollow nodes (nodes without items), giving the data structure its name.

References

[1]
G. S. Brodal. 1996. Worst-case efficient priority queues. In Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms (SODA’96). 52--58.
[2]
G. S. Brodal, G. Lagogiannis, and R. E. Tarjan. 2012. Strict fibonacci heaps. In Proceedings of the 44th ACM Symposium on Theory of Computing (STOC’12). 1177--1184.
[3]
M. R. Brown. 1978. Implementation and analysis of binomial queue algorithms. SIAM J. Comput. 7, 3 (1978), 298--319.
[4]
T. M. Chan. 2013. Quake heaps: A simple alternative to fibonacci heaps. In Space-Efficient Data Structures, Streams, and Algorithms. 27--32.
[5]
E. W. Dijkstra. 1959. A note on two problems in connexion with graphs. Numer. Math. 1 (1959), 269--271.
[6]
J. R. Driscoll, H. N. Gabow, R. Shrairman, and R. E. Tarjan. 1988. Relaxed heaps: An alternative to fibonacci heaps with applications to parallel computation. C. ACM 31, 11 (1988), 1343--1354.
[7]
J. Edmonds. 1967. Optimum branchings. J. Res. Nat. Bur. Stand. 71B (1967), 233--240.
[8]
A. Elmasry. 2010. The violation heap: A relaxed fibonacci-like heap. Discrete Math., Alg. Appl. 2, 4 (2010), 493--504.
[9]
M. L Fredman. 1999. On the efficiency of pairing heaps and related data structures. J. ACM 46, 4 (1999), 473--501.
[10]
M. L. Fredman and R. E. Tarjan. 1987. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 3 (1987), 596--615.
[11]
H. N. Gabow, Z. Galil, T. H. Spencer, and R. E. Tarjan. 1986. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica 6 (1986), 109--122.
[12]
B. Haeupler, S. Sen, and R. E. Tarjan. 2011. Rank-pairing heaps. SIAM J. Comput. 40, 6 (2011), 1463--1485.
[13]
P. Høyer. 1995. A general technique for implementation of efficient priority queues. In Proceedings of the 3rd Israeli Symposium on the Theory of Computing and Systems (ISTCS’95). 57--66.
[14]
J. Iacono and Ö. Özkan. 2014. Why some heaps support constant-amortized-time decrease-key operations, and others do not. In Proceedings of the 41st International Colloquium on Automata, Languages and Programming (ICALP’14). 637--649.
[15]
H. Kaplan, N. Shafrir, and R. E. Tarjan. 2002. Meldable heaps and boolean union-find. In Proceedings of the 34th ACM Symposium on Theory of Computing (STOC’02). 573--582.
[16]
H. Kaplan and R. E. Tarjan. 2008. Thin heaps, thick heaps. ACM Trans. Alg. 4, 1 (2008), 1--14.
[17]
H. Kaplan, R. E. Tarjan, and U. Zwick. 2014. Fibonacci heaps revisited. CoRR abs/1407.5750 (2014). http://arxiv.org/abs/1407.5750
[18]
D. E. Knuth. 1998. Sorting and Searching (2nd ed.). The art of computer programming, Vol. 3. Addison-Wesley.
[19]
G. L. Peterson. 1987. A Balanced Tree Scheme for Meldable Heaps with Updates. Technical Report GIT-ICS-87-23. School of Informatics and Computer Science, Georgia Institute of Technology, Atlanta, GA.
[20]
R. C. Prim. 1957. Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36 (1957), 1389--1401.
[21]
T. Takaoka. 2003. Theory of 2-3 heaps. Discr. Appl. Math. 126, 1 (2003), 115--128.
[22]
R. E. Tarjan. 1983. Data Structures and Network Algorithms. SIAM.
[23]
R. E. Tarjan. 1985. Amortized computational complexity. SIAM J. Algebr. Discr. Methods 6 (1985), 306--318.
[24]
J. Vuillemin. 1978. A data structure for manipulating priority queues. C. ACM 21 (1978), 309--314.

Cited By

View all
  • (2024)Strict Fibonacci HeapsACM Transactions on Algorithms10.1145/370769221:2(1-18)Online publication date: 10-Dec-2024
  • (2021)Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming ModelsSIAM Journal on Computing10.1137/19M128695550:3(815-856)Online publication date: 4-May-2021
  • (2020)Lazy Search Trees2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS46700.2020.00071(704-715)Online publication date: Nov-2020

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Algorithms
ACM Transactions on Algorithms  Volume 13, Issue 3
July 2017
390 pages
ISSN:1549-6325
EISSN:1549-6333
DOI:10.1145/3058789
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 July 2017
Accepted: 01 May 2017
Revised: 01 February 2017
Received: 01 November 2016
Published in TALG Volume 13, Issue 3

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Data structures
  2. amortized analysis
  3. heaps
  4. priority queues

Qualifiers

  • Research-article
  • Research
  • Refereed

Funding Sources

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)44
  • Downloads (Last 6 weeks)13
Reflects downloads up to 19 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Strict Fibonacci HeapsACM Transactions on Algorithms10.1145/370769221:2(1-18)Online publication date: 10-Dec-2024
  • (2021)Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming ModelsSIAM Journal on Computing10.1137/19M128695550:3(815-856)Online publication date: 4-May-2021
  • (2020)Lazy Search Trees2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS46700.2020.00071(704-715)Online publication date: Nov-2020

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media