Summary
It is shown how to use efficient mergeable heaps to improve the running time of two algorithms that solve optimization problems on trees.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Reading, Mass: Addison-Wesley 1974
Brown, M.R.: The analysis of a practical and nearly optimal priority queue. Stanford Ph.D. Dissertation. STAN-CS-77-600, Stanford University, 1977
Bruno, J.L.: Mean weighted flow-time criterion: In Computer and Job-Shop Scheduling Theory, E.G. Coffman, ed., pp. 101–138. New York: John Wiley 1976
Horn, W.A.: Single-machine job sequencing with treelike precedence ordering and linear delay panalties. SIAM J. Appl. Math. 23, 189–202 (1972)
Megiddo, N.: Computational complexity of the game theory approach to cost allocation for a tree. MOR 3, 189–196 (1978)
Author information
Authors and Affiliations
Additional information
The work of the author was supported in part by the Israel Commission for Basic Research and National Science Foundation grant MCS78-25301
Rights and permissions
About this article
Cite this article
Galil, Z. Applications of efficient mergeable heaps for optimization problems on trees. Acta Informatica 13, 53–58 (1980). https://doi.org/10.1007/BF00288535
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00288535