Solving parametric problems on trees

  • David Fernández-Baca
  • Giora Slutzki
Contributed Papers Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 294)


Combinatorial Optimization Problem Vertex Cover Vertex Cover Problem Minimum Vertex Cover Dynamic Programming Problem 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7 References

  1. [A]
    Atallah, M.J. Some dynamic computational geometry problems. Comp. & Maths. with Appls. 11, 12 (1985), 1171–1181.Google Scholar
  2. [BB]
    Bertelè, U. and Brioschi, F. Nonserial Dynamic Programming. Academic Press, New York, 1972.Google Scholar
  3. [BLW]
    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.Google Scholar
  4. [Bo]
    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.Google Scholar
  5. [ES]
    Eisner, M.J. and Severance, D.G. Mathematical techniques for efficient record segmentation in large shared databases. JACM 23 (1976), 619–635.Google Scholar
  6. [GJ]
    Garey, M. and Johnson, D. Computers and Intractability: A Guide to the theory of NP-Completeness. Freeman, San Francisco, 1979.Google Scholar
  7. [GSV]
    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.Google Scholar
  8. [Gu1]
    Gusfield, D. Sensitivity analysis for combinatorial optimization. Memo. No. UCB/ERL M80/22, Electronics Research Laboratory, Univ. of California, Berkeley, Calif, May 1980.Google Scholar
  9. [Gu2]
    Gusfield, D. Parametric combinatorial computing and a problem of program module distribution. JACM 30, 3 (1983), 551–563.Google Scholar
  10. [Ha]
    Harary, F. Graph Theory. Addison-Wesley, Reading, Massachusetts, 1969.Google Scholar
  11. [KH]
    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.Google Scholar
  12. [KI]
    Katoh, N. and Ibaraki, T. An efficient algorithm for the parametric resource allocation problem. Discrete Appl. Math. 10 (1985), 261–274.Google Scholar
  13. [LT]
    Lipton, R. and Tarjan, R. Applications of a planar separator theorem. SIAM J. Comput. 9, 3 (1980), 615–627.Google Scholar
  14. [Me]
    Megiddo, N. Dynamic location problems. IBM Almaden Research Center, Tech. Report RJ 4983, 1986.Google Scholar
  15. [MTZC]
    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.Google Scholar
  16. [NW]
    Natarajan, K.S. and White, L.J. Optimum domination in weighted trees. IPL 7, 6 (1978), 261–265.Google Scholar
  17. [RH]
    Ravi, S.S. and Hunt, H.B., III. Application of planar separator theorem to counting problems. Tech. Report 86-19, SUNY Albany, August 1986.Google Scholar
  18. [Ro]
    Rosenthal, A. Dynamic programming is optimal for nonserial optimization problems. SIAM J. Comput. 11, 1 (1982), 47–59.Google Scholar
  19. [Sh]
    Sharir, M. Almost linear upper bounds on the length of general Davenport-Schinzel sequences. Tech. Report No. 199, Dept. of Computer Science, NYU, 1985.Google Scholar
  20. [W]
    Wilf, H.S. The number of maximal independent sets in a tree. SIAM J. Alg. Discr. Meth. 7, 1 (1986), 125–130.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • David Fernández-Baca
    • 1
  • Giora Slutzki
    • 1
  1. 1.Computer Science DepartmentIowa State UniversityAmes

Personalised recommendations