This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
7 References
Atallah, M.J. Some dynamic computational geometry problems. Comp. & Maths. with Appls. 11, 12 (1985), 1171–1181.
Bertelè, U. and Brioschi, F. Nonserial Dynamic Programming. Academic Press, New York, 1972.
Bern, M.W., Lawler, E.L., and Wong, A.L. Linear time computation of optimal subgraphs of decomposable graphs. J. Algorithms 8 (1987), 216–235.
Bokhari, S.H. A shortest tree algorithm for optimal assignments across space and time in a distributed processor system. IEEE Trans. Software Eng. SE-7, 6 (1981), 583–589.
Eisner, M.J. and Severance, D.G. Mathematical techniques for efficient record segmentation in large shared databases. JACM 23 (1976), 619–635.
Garey, M. and Johnson, D. Computers and Intractability: A Guide to the theory of NP-Completeness. Freeman, San Francisco, 1979.
Gurevich, Y., Stockmeyer, L., and Vishkin, U. Solving NP-hard problems on graphs that are almost trees and an application to facility location problems. JACM 31, 3 (1984), 459–473.
Gusfield, D. Sensitivity analysis for combinatorial optimization. Memo. No. UCB/ERL M80/22, Electronics Research Laboratory, Univ. of California, Berkeley, Calif, May 1980.
Gusfield, D. Parametric combinatorial computing and a problem of program module distribution. JACM 30, 3 (1983), 551–563.
Harary, F. Graph Theory. Addison-Wesley, Reading, Massachusetts, 1969.
Kariv, O. and Hakimi, S.L. An algorithmic approach to network location problems I: the p-centers. SIAM J. Appl. Math. 37 (1979), 513–538.
Katoh, N. and Ibaraki, T. An efficient algorithm for the parametric resource allocation problem. Discrete Appl. Math. 10 (1985), 261–274.
Lipton, R. and Tarjan, R. Applications of a planar separator theorem. SIAM J. Comput. 9, 3 (1980), 615–627.
Megiddo, N. Dynamic location problems. IBM Almaden Research Center, Tech. Report RJ 4983, 1986.
Megiddo, N., Tamir, A., Zemel, E., and Chandrasekaran, R. An O(n log2 n) algorithm for the K-th nearest pair in a tree with applications to location problems. SIAM J. Comput. 10 (1981), 328–337.
Natarajan, K.S. and White, L.J. Optimum domination in weighted trees. IPL 7, 6 (1978), 261–265.
Ravi, S.S. and Hunt, H.B., III. Application of planar separator theorem to counting problems. Tech. Report 86-19, SUNY Albany, August 1986.
Rosenthal, A. Dynamic programming is optimal for nonserial optimization problems. SIAM J. Comput. 11, 1 (1982), 47–59.
Sharir, M. Almost linear upper bounds on the length of general Davenport-Schinzel sequences. Tech. Report No. 199, Dept. of Computer Science, NYU, 1985.
Wilf, H.S. The number of maximal independent sets in a tree. SIAM J. Alg. Discr. Meth. 7, 1 (1986), 125–130.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernández-Baca, D., Slutzki, G. (1988). Solving parametric problems on trees. In: Cori, R., Wirsing, M. (eds) STACS 88. STACS 1988. Lecture Notes in Computer Science, vol 294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035831
Download citation
DOI: https://doi.org/10.1007/BFb0035831
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18834-6
Online ISBN: 978-3-540-48190-4
eBook Packages: Springer Book Archive