An O(n) algorithm for finding an optimal position with relative distances in an evolutionary tree
Information Processing Letters
An efficient algorithm for the length-constrained heaviest path problem on a tree
Information Processing Letters
Finding a longest nonnegative path in a constant degree tree
Information Processing Letters
| Hi-index | 0.89 |
The length-constrained heaviest path (LCHP) in a weighted tree T, where each edge is assigned a weight and a length, is the path P in T with maximum total path weight and total path length bounded by a given value B. This paper presents an O(nlogn) time LCHP algorithm which utilizes a data structure constructed from the spine decomposition of the input tree. This is an improvement over the existing algorithm by Wu et al. (1999), which runs in O(nlog^2n) time. Our method also improves on a previous O(nlogn) time algorithm by Kim (2005) for the special case of finding a longest nonnegative path in a constant degree tree in that we can handle trees of arbitrary degree within the same time bounds.