Login / Signup
Algorithms for finding the weight-constrained k longest paths in a tree and the length-constrained k maximum-sum segments of a sequence.
Hsiao-Fei Liu
Kun-Mao Chao
Published in:
Theor. Comput. Sci. (2008)
Keyphrases
</>
maximum number
learning algorithm
computational cost
optimization problems
theoretical analysis
data structure
computationally efficient
upper bound
orders of magnitude
significant improvement
tree structure
graph theory
longest common subsequence