Skip to main content
SpringerLink
Log in

Quake Heaps: A Simple Alternative to Fibonacci Heaps

  • Chapter
Space-Efficient Data Structures, Streams, and Algorithms

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8066))

Abstract

This note describes a data structure that has the same theoretical performance as Fibonacci heaps, supporting decrease-key operations in O(1) amortized time and delete-min operations in O(log n) amortized time. The data structure is simple to explain and analyze, and may be of pedagogical value

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Driscoll, J., Gabow, H., Shrairman, R., Tarjan, R.: Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation. Commun. ACM 31, 1343–1354 (1988)

    Article  MathSciNet  Google Scholar 

  2. Elmasry, A.: The violation heap: a relaxed Fibonacci-like heap. Discrete Math., Alg. and Appl. 2, 493–504 (2010)

    MathSciNet  MATH  Google Scholar 

  3. Elmasry, A.: Pairing heaps with O(loglogn) decrease cost. In: Proc. 20th ACM–SIAM Sympos. Discrete Algorithms, pp. 471–476 (2009)

    Google Scholar 

  4. Fredman, M., Sedgewick, R., Sleator, D., Tarjan, R.: The pairing heap: a new form of self-adjusting heap. Algorithmica 1, 111–129 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  5. Fredman, M., Tarjan, R.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 596–615 (1987)

    Article  MathSciNet  Google Scholar 

  6. Haeupler, B., Sen, S., Tarjan, R.E.: Rank-pairing heaps. SIAM J. Comput. 40, 1463–1485 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  7. Høyer, P.: A general technique for implementation of efficient priority queues. In: Proc. 3rd Israel Sympos. Theory of Comput. Sys., pp. 57–66 (1995)

    Google Scholar 

  8. Kaplan, H., Tarjan, R.: Thin heaps, thick heaps. ACM Trans. Algorithms 4(1), 3 (2008)

    Article  MathSciNet  Google Scholar 

  9. Peterson, G.: A balanced tree scheme for meldable heaps with updates. Tech. Report GIT-ICS-87-23, Georgia Institute of Technology (1987)

    Google Scholar 

  10. Pettie, S.: Towards a final analysis of pairing heaps. In: Proc. 46th IEEE Sympos. Found. Comput. Sci., pp. 174–183 (2005)

    Google Scholar 

  11. Takaoka, T.: Theory of 2-3 heaps. Discrete Applied Math. 126, 115–128 (2003)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cheriton School of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada

    Timothy M. Chan

Authors
  1. Timothy M. Chan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Computer and Information Science, University of Ljubljana, Ljubljana, Slovenia

    Andrej Brodnik

  2. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON, Canada

    Alejandro López-Ortiz

  3. The Institute of Mathematical Sciences, Chennai, India

    Venkatesh Raman

  4. Facultad de Ingeniería, Universidad de la República, Montevideo, Uruguay

    Alfredo Viola

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Chan, T.M. (2013). Quake Heaps: A Simple Alternative to Fibonacci Heaps. In: Brodnik, A., López-Ortiz, A., Raman, V., Viola, A. (eds) Space-Efficient Data Structures, Streams, and Algorithms. Lecture Notes in Computer Science, vol 8066. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40273-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40273-9_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40272-2

  • Online ISBN: 978-3-642-40273-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation