Abstract
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when there are up to n elements in the priority queue, can be converted into a priority queue data structure that also supports meld operations at essentially no extra cost, at least in the amortized sense. More specifically, the new data structure supports insert, meld and find-min operations in O(1) amortized time, and delete operations in O(pq(n) α(n,n/pq(n))) amortized time, where α(m,n) is a functional inverse of the Ackermann function. For all conceivable values of pq(n), the term α(n,n/pq(n)) is constant. This holds, for example, if pq(n)=Ω(log* n). In such cases, adding the meld operation does not increase the amortized asymptotic cost of the priority queue operations. The result is obtained by an improved analysis of a construction suggested recently by three of the authors in [14]. The construction places a non-meldable priority queue at each node of a union-find data structure. We also show that when all keys are integers in [1,N], we can replace n in all the bounds stated above by N.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alstrup, S., Husfeldt, T., Rauhe, T.: Marked ancestor problems. Technical Report DIKU 98-8, Dept. Comput. Sc., Univ. Copenhagen (The result needed from here is not included in the FOCS 1998 extended abstract) (1998)
Brodal, G.S.: Worst-case efficient priority queues. In: Proc. of 7th SODA, pp. 52–58 (1996)
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)
Edmonds, J.: Optimum branchings. J. Res. Nat. Bur. Standards 71B, 233–240 (1967)
Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM 34, 596–615 (1987)
Fredman, M.L., Willard, D.E.: Surpassing the information-theoretic bound with fusion trees. Journal of Computer and System Sciences 47(3), 424–436 (1993)
Fredman, M.L., Willard, D.E.: Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences 48, 533–551 (1994)
Gabow, H.N., Galil, Z., Spencer, T.H., Tarjan, R.E.: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica 6, 109–122 (1986)
Han, Y.: Deterministic sorting in O(n log log n) time and linear space. In: Proc. of 34th STOC, pp. 602–608 (2002)
Han, Y., Thorup, M.: Integer sorting in O(n\(\sqrt{log log n}\)) expected time and linear space. In: Proc. of 43rd FOCS, pp.135–144 (2002)
Kaplan, H., Shafrir, N., Tarjan, R.E.: Meldable heaps and boolean union-find. In: Proc. of 34th STOC, pp. 573–582 (2002)
Kaplan, H., Shafrir, N., Tarjan, R.E.: Union-find with deletions. In: Proc. of 13th SODA, pp. 19–28 (2002)
Mehlhorn, K., Näher, S.: Bounded ordered dictionaries in O(log log N) time and O(n) space. Information Processing Letters 35(4), 183–189 (1990)
Mendelson, R., Thorup, M., Zwick, U.: Meldable RAM priority queues and minimum directed spanning trees. In: Proc. of 15th SODA, pp. 40–48 (2004)
Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technical Journal 36, 1389–1401 (1957)
Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. Journal of the ACM 22, 215–225 (1975)
Tarjan, R.E.: Amortized computational complexity. SIAM Journal on Algenraic and Discrete Methods 6, 306–318 (1985)
Thorup, M.: On RAM priority queues. SIAM Journal on Computing 30(1), 86–109 (2000)
Thorup, M.: Equivalence between priority queues and sorting. In: Proc. of 43rd FOCS, pp. 125–134 (2002)
Thorup, M.: Integer priority queues with decrease key in constant time and the single source shortest paths problem. In: Proc. of 35th STOC, pp. 149–158 (2003)
Thorup, M.: On AC0 implementations of fusion trees and atomic heaps. In: Proc. of 14th SODA, pp. 699–707 (2003)
van Boas, P.E.: Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters 6(3), 80–82 (1977)
van Emde Boas, P., Kaas, R., Zijlstra, E.: Design and implementation of an efficient priority queue. Mathematical Systems Theory 10, 99–127 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mendelson, R., Tarjan, R.E., Thorup, M., Zwick, U. (2004). Melding Priority Queues. 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_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-27810-8_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22339-9
Online ISBN: 978-3-540-27810-8
eBook Packages: Springer Book Archive