Related references
Note: Only part of the references are listed.An optimal algorithm for the maximum-density path in a tree
Bang Ye Wu
INFORMATION PROCESSING LETTERS (2009)
Fast Algorithms for the Density Finding Problem
D. T. Lee et al.
ALGORITHMICA (2009)
Finding a maximum-density path in a tree under the weight and length constraints
Sun-Yuan Hsieh et al.
INFORMATION PROCESSING LETTERS (2008)
A survey of recent developments in multiobjective optimization
Altannar Chinchuluun et al.
ANNALS OF OPERATIONS RESEARCH (2007)
Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics
Hoong Chuin Lau et al.
DISCRETE OPTIMIZATION (2006)
Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications
MH Goldwasser et al.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2005)
An optimal algorithm for the maximum-density segment problem
KM Chung et al.
SIAM JOURNAL ON COMPUTING (2004)
Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis
YL Lin et al.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2002)
Share Paper
