Hsiao-Fei Liu, Kun-Mao Chao. Algorithms for finding the weight-constrained k longest paths in a tree and the length-constrained k maximum-sum segments of a sequence. Theoretical Computer Science, 407(1-3):349-358, 2008. [doi]
@article{LiuC08:18,
title = {Algorithms for finding the weight-constrained k longest paths in a tree and the length-constrained k maximum-sum segments of a sequence},
author = {Hsiao-Fei Liu and Kun-Mao Chao},
year = {2008},
doi = {10.1016/j.tcs.2008.06.052},
url = {http://dx.doi.org/10.1016/j.tcs.2008.06.052},
researchr = {https://researchr.org/publication/LiuC08%3A18},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {407},
number = {1-3},
pages = {349-358},
}