An improved algorithm for finding a length-constrained maximum-density subtree in a tree

Authors:
Hsin-Hao Su;Chin Lung Lu;Chuan Yi Tang
Affiliations:
Department of Computer Science, National Tsing Hua University, Hsinchu 300, Taiwan;Institute of Bioinformatics, National Chiao Tung University, Hsinchu 300, Taiwan and Department of Biological Science and Technology, National Chiao Tung University, Hsinchu 300, Taiwan;Department of Computer Science, National Tsing Hua University, Hsinchu 300, Taiwan
Venue:
Information Processing Letters
Year:
2008

Citing 9
Cited 1

An efficient algorithm for the length-constrained heaviest path problem on a tree

Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis

Journal of Computer and System Sciences - Computational biology 2002
Linear-time algorithm for finding a maximum-density segment of a sequence

Information Processing Letters
An Optimal Algorithm for the Maximum-Density Segment Problem

SIAM Journal on Computing
Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications

Journal of Computer and System Sciences
Finding a maximum-density path in a tree under the weight and length constraints

Information Processing Letters
Finding a weight-constrained maximum-density subtree in a tree

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Note: Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics

Discrete Optimization

The weight-constrained maximum-density subtree problem and related problems in trees

The Journal of Supercomputing

Quantified Score

Hi-index	0.90

Visualization

Abstract

Given a tree T with weight and length on each edge, as well as a lower bound L and an upper bound U, the so-called length-constrained maximum-density subtree problem is to find a maximum-density subtree in T such that the length of this subtree is between L and U. In this study, we present an algorithm that runs in O(nUlogn) time for the case when the edge lengths are positive integers, where n is the number of nodes in T, which is an improvement over the previous algorithms when U=@W(logn). In addition, we show that the time complexity of our algorithm can be reduced to O(nLlognL), when the edge lengths being considered are uniform.