Solving parametric problems on trees
References (26)
Some dynamic computational geometry problems
Comput. Math. Appl.
(1985)- et al.
Linear time computation of optimal subgraphs of decomposable graphs
J. Algorithms
(1987) - et al.
An efficient algorithm for the parametric resource allocation problem
Discrete Appl. Math.
(1985) - et al.
Optimum domination in weighted trees
Inform. Process. Lett.
(1978) - et al.
Nonserial Dynamic Programming
(1972) A shortest tree algorithm for optimal assignments across space and time in a distributed processor system
IEEE Trans. Software Engrg.
(1981)Complexity of some parametric integer and network programming problems
Math. Programming
(1983)Linear Programming
(1983)- et al.
Mathematical techniques for efficient record segmentation in large shared databases
J. Assoc. Comput. Mach.
(1976) - et al.
Computers and Intractability: A Guide to the theory of NP-Completeness
(1979)
Solving NP-hard problems on graphs that are almost trees and an application to facility location problems
J. Assoc. Comput. Mach.
(1984)
Sensitivity Analysis for Combinatorial Optimization
Parametric combinatorial computing and a problem of program module distribution
J. Assoc. Comput. Mach.
(1983)
Cited by (8)
Optimal Parametric Search on Graphs of Bounded Tree-Width
1997, Journal of AlgorithmsParametric problems on graphs of bounded tree-width
1994, Journal of AlgorithmsAn algorithm for outerplanar graphs with parameter
1991, Journal of AlgorithmsComputing min-max regret solutions in possibilistic combinatorial optimization problems
2010, Studies in Fuzziness and Soft ComputingParametric analysis for ungapped Markov models of evolution
2009, ACM Transactions on AlgorithmsParametric Module Allocation on Partial k-trees
1993, IEEE Transactions on Computers
Copyright © 1989 Published by Elsevier Inc.