Skip to main content
SpringerLink
Log in

Layered Heaps

  • Conference paper
Book cover Algorithm Theory - SWAT 2004 (SWAT 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3111))

Included in the following conference series:

Abstract

We introduce a framework for reducing the number of comparisons performed in the deletion and minimum deletion operations for priority queues. In particular, we give a priority queue with constant cost per insertion and minimum finding, and logarithmic cost with at most logn+O(loglogn) comparisons per deletion and minimum deletion, improving over the bound of 2 logn+O(1) comparisons for the binomial queues and the pairing heaps. We also give a priority queue that supports, in addition to the above operations, the decrease-key operation. This latter priority queue achieves, in the amortized sense, constant cost per insertion, minimum finding and decrease-key operations, and logarithmic cost with at most 1.44logn+O(loglogn) comparisons per deletion and minimum deletion.

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. Andersson, A., Lai, T.W.: Fast updating of well-balanced trees. In: Gilbert, J.R., Karlsson, R. (eds.) SWAT 1990. LNCS, vol. 447, pp. 111–121. Springer, Heidelberg (1990)

    Google Scholar 

  2. Brown, M.: Implementation and analysis of binomial queue algorithms. SIAM J. Comput. 7, 298–319 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  3. Brodal, G.: Fast meldable priority queues. In: Sack, J.-R., Akl, S.G., Dehne, F., Santoro, N. (eds.) WADS 1995. LNCS, vol. 955, pp. 282–290. Springer, Heidelberg (1995)

    Google Scholar 

  4. Brodal, G.: Worst-case efficient priority queues. In: 7th ACM SODA, pp. 52–58 (1996)

    Google Scholar 

  5. Carlsson, S.: An optimal algorithm for deleting the root of a heap. Inf. Proc. Lett. 37, 117–120 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  6. Carlsson, S., Munro, J., Poblete, P.: An implicit binomial queue with constant insertion time. In: Karlsson, R., Lingas, A. (eds.) SWAT 1988. LNCS, vol. 318, pp. 1–13. Springer, Heidelberg (1988)

    Google Scholar 

  7. Driscoll, J., Gabow, H., Shairman, R., Tarjan, R.: Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation. Comm. ACM 31(11), 1343–1354 (1988)

    Article  MathSciNet  Google Scholar 

  8. Elmasry, A., Fredman, M.: Adaptive sorting and the information theoretic lower bound. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 654–662. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  9. Elmasry, A., Ramachandran, V., Sridhar, S.: Adaptive sorting using binomial heap. (submitted)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  12. Gabow, H., Bentley, J., Tarjan, R.: Scaling and related techniques for computational geometry. In: 16th ACM STOC, pp. 135–143 (1984)

    Google Scholar 

  13. Gonnet, G., Munro, J.: Heaps on heaps. SIAM J. Comput. 15(4), 964–971 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  14. Iacono, J.: Improved upper bounds for pairing heaps. In: Halldórsson, M.M. (ed.) SWAT 2000. LNCS, vol. 1851, pp. 32–45. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  15. Kaplan, H., Tarjan, R.: New heap data structures. TR-597-99, Princeton University (1999)

    Google Scholar 

  16. Katajainen, J., Vitale, F.: Navigation piles with applications to sorting, priority queues, and priority deques. Nord. J. Comput. 10, 238–262 (2003)

    MATH  MathSciNet  Google Scholar 

  17. Levcopoulos, C., Petersson, O.: Adaptive Heapsort. J. Alg. 14, 395–413 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  18. Overmars, M., van Leeuwen, J.: Worst-case optimal insertion and deletion methods for decomposable searching problems. Inf. Proc. Lett. 12, 168–173 (1981)

    Article  MATH  Google Scholar 

  19. Tarjan, R.: Amortized computational complexity. SIAM J. Alg. Disc. Meth. 6, 306–318 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  20. Vuillemin, J.: A data structure for manipulating priority queues. Comm. ACM 21(4), 309–314 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  21. Vuillemin, J.: A unifying look at data structures. Comm. ACM 23, 229–237 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  22. Williams, J.: Algorithm 232, Heapsort. Comm. ACM 7(6), 347–348 (1964)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Alexandria University, Alexandria, Egypt

    Amr Elmasry

Authors
  1. Amr Elmasry
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Augsburg, 86135, Augsburg, Germany

    Torben Hagerup

  2. Department of Computing, University of Copenhagen, Denmark

    Jyrki Katajainen

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Elmasry, A. (2004). Layered Heaps. In: Hagerup, T., Katajainen, J. (eds) Algorithm Theory - SWAT 2004. SWAT 2004. Lecture Notes in Computer Science, vol 3111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27810-8_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27810-8_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22339-9

  • Online ISBN: 978-3-540-27810-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation