Advertisement

Replacing Mark Bits with Randomness in Fibonacci Heaps

  • Jerry LiEmail author
  • John Peebles
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9134)

Abstract

A Fibonacci heap is a deterministic data structure implementing a priority queue with optimal amortized operation costs. An unfortunate aspect of Fibonacci heaps is that they must maintain a “mark bit” which serves only to ensure efficiency of heap operations, not correctness. Karger proposed a simple randomized variant of Fibonacci heaps in which mark bits are replaced by coin flips. This variant still has expected amortized cost O(1) for insert, decrease-key, and merge. Karger conjectured that this data structure has expected amortized cost \(O(\log s)\) for delete-min, where s is the number of heap operations.

We give a tight analysis of Karger’s randomized Fibonacci heaps, resolving Karger’s conjecture. Specifically, we obtain matching upper and lower bounds of \(\varTheta (\log ^2 s / \log \log s)\) for the runtime of delete-min. We also prove a tight lower bound of \(\varOmega (\sqrt{n})\) on delete-min in terms of the number of heap elements n. The request sequence used to prove this bound also solves an open problem of Fredman on whether cascading cuts are necessary. Finally, we give a simple additional modification to these heaps which yields a tight runtime \(O(\log ^2 n / \log \log n)\) for delete-min.

Keywords

Priority Queue Full Paper Extraneous Data Request Sequence Amortize Cost 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AVL62]
    Adelson-Velskii, G.M., Landis, E.M.: An algorithm for the organization of information. Dokl. Akad. Nauk SSSR 3, 263–266 (1962)MathSciNetGoogle Scholar
  2. [Cha13]
    Chan, T.M.: Quake heaps: a simple alternative to fibonacci heaps. In: Brodnik, A., López-Ortiz, A., Raman, V., Viola, A. (eds.) Ianfest-66. LNCS, vol. 8066, pp. 27–32. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  3. [DGST88]
    Driscoll, J.R., Gabow, H.N., Shrairman, R., Tarjan, R.E.: Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation. Commun. ACM 31(11), 1343–1354 (1988)MathSciNetCrossRefGoogle Scholar
  4. [Elm09]
    Elmasry, A.: Pairing heaps with o(log log n) decrease cost. In: Claire Mathieu, editor, SODA, pp. 471–476. SIAM (2009)Google Scholar
  5. [Elm10]
    Elmasry, A.: The violation heap: a relaxed Fibonacci-like heap. Discrete Math., Alg. and Appl. 2(4), 493–504 (2010)zbMATHMathSciNetGoogle Scholar
  6. [Fre05]
    Fredman, M.L.: Binomial, Fibonacci, and pairing heaps. In: Mehta, D.P., Sahni, S. (eds.) Handbook of data structures and applications. Chapman & Hall/CRC, Boca Raton (2005)Google Scholar
  7. [FSST86]
    Fredman, M.L., Sedgewick, R., Sleator, D.D., Tarjan, R.E.: The pairing heap: A new form of self-adjusting heap. Algorithmica 1(1), 111–129 (1986)zbMATHMathSciNetCrossRefGoogle Scholar
  8. [FT87]
    Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3), 596–615 (1987)MathSciNetCrossRefGoogle Scholar
  9. [GS78]
    Guibas, L.J., Sedgewick, R.: A dichromatic framework for balanced trees. FOCS 1978, 8–21 (1978)MathSciNetGoogle Scholar
  10. [Høy95]
    Høyer, P.: A general technique for implementation of efficient priority queues. In: ISTCS 1995, ISTCS 1995, p. 57-, Washington, DC, IEEE Computer Society (1995)Google Scholar
  11. [HST11]
    Haeupler, B., Sen, S., Tarjan, R.E.: Rank-pairing heaps. SIAM J. Comput. 40(6), 1463–1485 (2011)zbMATHMathSciNetCrossRefGoogle Scholar
  12. [Kar00]
    Karger, D.: untitled manuscript. unpublished (2000)Google Scholar
  13. Kar13]
    Karger, D.: personal communication (2013)Google Scholar
  14. [KT08]
    Kaplan, H., Tarjan, R.E.: Thin heaps, thick heaps. ACM Trans. Algorithms 4(1), 3:1–3:14 (2008)MathSciNetCrossRefGoogle Scholar
  15. [KTZ14]
    Kaplan, H., Tarjan, R.E., Zwick, U.: Fibonacci heaps revisited (2014). CoRR, abs/1407.5750
  16. [LP14]
    Li, J., Peebles, J.: Replacing mark bits with randomness in fibonacci heaps (2014). CoRR, abs/1407.2569
  17. [Pet87]
    Peterson, G.: A balanced tree scheme for meldable heaps with updates. Technical Report GIT-ICS-87-23, Georgia Institute of Technology (1987)Google Scholar
  18. [Pet05]
    Pettie, S.: Towards a final analysis of pairing heaps. FOCS 2005, 174–183 (2005)Google Scholar
  19. [Pri09]
    Price, E.: Randomized Fibonacci heaps. unpublished (2009)Google Scholar
  20. [Tak03]
    Takaoka, T.: Theory of 2–3 heaps. Discrete Appl. Math. 126(1), 115–128 (2003)zbMATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  1. 1.MITCambridgeUSA

Personalised recommendations