An optimal algorithm for the maximum-density path in a tree

Authors:
Bang Ye Wu
Affiliations:
Dept. of Computer Science and Information Engineering, National Chung Cheng University, Taiwan
Venue:
Information Processing Letters
Year:
2009

Citing 9
Cited 2

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

Information Processing Letters
Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis

Journal of Computer and System Sciences - Computational biology 2002
Lower bounds for algebraic computation trees

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
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
Cardinality constrained facility location problems in trees

Cardinality constrained facility location problems in trees
Finding a maximum-density path in a tree under the weight and length constraints

Information Processing Letters
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
Note: Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics

Discrete Optimization

The density maximization problem in graphs

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
The density maximization problem in graphs

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.89

Visualization

Abstract

We studied the problem of finding the maximum-density path in a tree. By spine decomposition and a linear-time algorithm for the maximum density segment problem, we developed an O(nlogn) time algorithm, which improves the previously best result of O(nlog^2n) by using centroid decomposition. We also show the time complexity is optimal in the algebraic computation tree model.