research-article

Strict fibonacci heaps

Authors:

Gerth Stølting Brodal,

George Lagogiannis,

Robert E. TarjanAuthors Info & Claims

STOC '12: Proceedings of the forty-fourth annual ACM symposium on Theory of computing

Pages 1177 - 1184

https://doi.org/10.1145/2213977.2214082

Published: 19 May 2012 Publication History

Abstract

We present the first pointer-based heap implementation with time bounds matching those of Fibonacci heaps in the worst case. We support make-heap, insert, find-min, meld and decrease-key in worst-case O(1) time, and delete and delete-min in worst-case O(lg n) time, where n is the size of the heap. The data structure uses linear space.

A previous, very complicated, solution achieving the same time bounds in the RAM model made essential use of arrays and extensive use of redundant counter schemes to maintain balance. Our solution uses neither. Our key simplification is to discard the structure of the smaller heap when doing a meld. We use the pigeonhole principle in place of the redundant counter mechanism.

Supplementary Material

JPG File (stoc_13a_5.jpg)

Download
10.44 KB

MP4 File (stoc_13a_5.mp4)

Download
134.65 MB

References

[1]

Gerth Stølting Brodal. Fast meldable priority queues. In Proc. 4th International Workshop Algorithms and Data Structures, volume 955 of Lecture Notes in Computer Science, pages 282--290. Springer, 1995.

Digital Library

[2]

Gerth Stølting Brodal. Worst-case efficient priority queues. InProc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 52--58. SIAM, 1996.

Digital Library

[3]

Svante Carlsson, J. Ian Munro, and Patricio V. Poblete. An implicit binomial queue with constant insertion time. In Proc. 1st Scandinavian Workshop on Algorithm Theory, volume 318 of Lecture Notes in Computer Science, pages 1--13. Springer, 1988.

Digital Library

[4]

Timothy M. Chan. Quake heaps: a simple alternative to Fibonacci heaps. Manuscript, 2009.

[5]

Clark Allan Crane. Linear lists and priority queues as balanced binary trees. PhD thesis, Stanford University, Stanford, CA, USA, 1972.

[6]

James R. Driscoll, Harold N. Gabow, Ruth Shrairman, and Robert E. Tarjan. Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation. Communications of the ACM, 31(11):1343--1354, 1988.

Digital Library

[7]

Amr Elmasry. Layered heaps. In Proc. 9th Scandinavian Workshop on Algorithm Theory, volume 3111 of Lecture Notes in Computer Science, pages 212--222. Springer, 2004.

[8]

Amr Elmasry. Parameterized self-adjusting heaps. J. Algorithms, 52(2):103--119, 2004.

Digital Library

[9]

Amr Elmasry. Pairing heaps with o(log logn) decrease cost. In Proc. 20th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 471--476. SIAM, 2009.

Digital Library

[10]

Amr Elmasry. The violation heap: A relaxed Fibonacci-like heap. In Proc. 16th Annual International Conference on Computing and Combinatorics, volume 6196 of Lecture Notes in Computer Science, pages 479--488. Springer, 2010.

Digital Library

[11]

Amr Elmasry, Claus Jensen, and Jyrki Katajainen. On the power of structural violations in priority queues. In Proc. 13th Computing: The Australasian Theory Symposium., volume 65 of CRPIT, pages 45--53. Australian Computer Society, 2007.

Digital Library

[12]

Amr Elmasry, Claus Jensen, and Jyrki Katajainen. Two-tier relaxed heaps.Acta Informatica, 45(3):193--210, 2008.

Digital Library

[13]

Michael L. Fredman. On the efficiency of pairing heaps and related data structures.Journal of the ACM, 46(4):473--501, 1999.

Digital Library

[14]

Michael L. Fredman, Robert Sedgewick, Daniel Dominic Sleator, and Robert Endre Tarjan. The pairing heap: A new form of self-adjusting heap. Algorithmica, 1(1):111--129, 1986.

Digital Library

[15]

Michael L. Fredman and Robert Endre Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34(3):596--615, 1987.

Digital Library

[16]

Bernhard Haeupler, Siddhartha Sen, and Robert Endre Tarjan. Rank-pairing heaps. In Proc. 17th Annual European Symposium on Algorithsm, volume 5757 of Lecture Notes in Computer Science, pages 659--670. Springer, 2009. SIAM Journal of Computing, to appear.

[17]

Peter Høyer. A general technique for implementation of efficient priority queues. In Proc. Third Israel Symposium on the Theory of Computing and Systems, pages 57--66, 1995.

Digital Library

[18]

Haim Kaplan and Robert E. Tarjan. New heap data structures. Technical report, Department of Computer Science, Princeton University, 1999.

[19]

Haim Kaplan and Robert Endre Tarjan. Thin heaps, thick heaps.ACM Transactions on Algorithms, 4(1), 2008.

Digital Library

[20]

Donald E. Knuth. The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition. Addison-Wesley, 1973.

[21]

Gary L. Peterson. A balanced tree scheme for meldable heaps with updates. Technical Report GIT-ICS-87-23, School of Information and Computer Science, Georgia Institute of Technology, 1987.

[22]

Seth Pettie. Towards a final analysis of pairing heaps. In Proc. 46th Annual IEEE Symposium on Foundations of Computer Science, pages 174--183. IEEE Computer Society, 2005.

Digital Library

[23]

Daniel Dominic Sleator and Robert Endre Tarjan. Self-adjusting heaps.SIAM Journal of Computing, 15(1):52--69, 1986.

Digital Library

[24]

Jean Vuillemin. A data structure for manipulating priority queues.Communications of the ACM, 21(4):309--315, 1978.

Digital Library

[25]

John William Joseph Williams. Algorithm 232: Heapsort. Communications of the ACM, 7(6):347--348, 1964.

Cited By

Brodal GLagogiannis GTarjan R(2024)Strict Fibonacci HeapsACM Transactions on Algorithms10.1145/370769221:2(1-18)Online publication date: 10-Dec-2024
https://dl.acm.org/doi/10.1145/3707692
Haeupler BHladík RRozhoň VTarjan RTetĕk J(2024)Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS61266.2024.00125(2099-2130)Online publication date: 27-Oct-2024
https://doi.org/10.1109/FOCS61266.2024.00125
Casel KFriedrich TNeubert SSchmid M(2024)Shortest distances as enumeration problemDiscrete Applied Mathematics10.1016/j.dam.2023.08.027342:C(89-103)Online publication date: 15-Jan-2024
https://dl.acm.org/doi/10.1016/j.dam.2023.08.027
Show More Cited By

Index Terms

Strict fibonacci heaps

Recommendations

Strict Fibonacci Heaps
We present the strict Fibonacci heap, the first pointer-based heap implementation with time bounds matching those of Fibonacci heaps in the worst case. Strict Fibonacci heaps support make-heap, insert, find-min, meld and decrease-key in worst-case \(O(1)\...
Toward Optimal Self-Adjusting Heaps

We give a variant of the pairing heaps that achieves the following amortized costs: O(1) per find-min and insert, O(log log n) per decrease-key and meld, O(log n) per delete-min; where n is the number of elements in the resulting heap on which the ...
Hollow Heaps

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(...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '12: Proceedings of the forty-fourth annual ACM symposium on Theory of computing

May 2012

1310 pages

ISBN:9781450312455

DOI:10.1145/2213977

General Chair:
Howard Karloff
AT&T Labs--Research
,
Program Chair:
Toniann Pitassi
University of Toronto

Copyright © 2012 ACM.

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 ACM 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]

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 May 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

STOC'12

Sponsor:

SIGACT

STOC'12: Symposium on Theory of Computing

May 19 - 22, 2012

New York, New York, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

45
Total Citations
View Citations
292
Total Downloads

Downloads (Last 12 months)51
Downloads (Last 6 weeks)9

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Brodal GLagogiannis GTarjan R(2024)Strict Fibonacci HeapsACM Transactions on Algorithms10.1145/370769221:2(1-18)Online publication date: 10-Dec-2024
https://dl.acm.org/doi/10.1145/3707692
Haeupler BHladík RRozhoň VTarjan RTetĕk J(2024)Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS61266.2024.00125(2099-2130)Online publication date: 27-Oct-2024
https://doi.org/10.1109/FOCS61266.2024.00125
Casel KFriedrich TNeubert SSchmid M(2024)Shortest distances as enumeration problemDiscrete Applied Mathematics10.1016/j.dam.2023.08.027342:C(89-103)Online publication date: 15-Jan-2024
https://dl.acm.org/doi/10.1016/j.dam.2023.08.027
Ostrovsky B(2024)Privacy-Preserving DijkstraAdvances in Cryptology – CRYPTO 202410.1007/978-3-031-68400-5_3(74-110)Online publication date: 16-Aug-2024
https://doi.org/10.1007/978-3-031-68400-5_3
Galcik PMrena MPiatrikova LStankevich S(2023)Advanced Priority Queues in the OPTICS Clustering Algorithm2023 International Conference on Information and Digital Technologies (IDT)10.1109/IDT59031.2023.10194445(257-266)Online publication date: 22-Jun-2023
https://doi.org/10.1109/IDT59031.2023.10194445
Dutta AKanti Kumar P(2023)The Indian Search AlgorithmCybersecurity and Evolutionary Data Engineering10.1007/978-981-99-5080-5_29(335-342)Online publication date: 20-Sep-2023
https://doi.org/10.1007/978-981-99-5080-5_29
Klein RKübel DLangetepe ESack JSchwarzwald B(2022)A new model and algorithms in firefighting theoryDiscrete Applied Mathematics10.1016/j.dam.2021.12.005319:C(296-309)Online publication date: 15-Oct-2022
https://dl.acm.org/doi/10.1016/j.dam.2021.12.005
Ruiz EDíaz SGonzález J(2022)State Variable Implications on Hydraulic State EstimationWater Resources Management10.1007/s11269-022-03152-x36:8(2549-2569)Online publication date: 5-May-2022
https://doi.org/10.1007/s11269-022-03152-x
Gatter Tvon Löhneysen SFallmann JDrozdova PHartmann TStadler P(2021)LazyB: fast and cheap genome assemblyAlgorithms for Molecular Biology10.1186/s13015-021-00186-516:1Online publication date: 1-Jun-2021
https://doi.org/10.1186/s13015-021-00186-5
Przybylski B(2021)Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing timesJournal of Combinatorial Optimization10.1007/s10878-021-00821-244:1(207-222)Online publication date: 16-Oct-2021
https://doi.org/10.1007/s10878-021-00821-2
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten