Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics
From MaRDI portal
Recommendations
Cites work
- An efficient algorithm for the length-constrained heaviest path problem on a tree
- An Optimal Algorithm for the Maximum-Density Segment Problem
- Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
- Finding a length-constrained maximum-density path in a tree
- scientific article; zbMATH DE number 1945161 (Why is no real title available?)
- Linear-time algorithm for finding a maximum-density segment of a sequence
- Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications
Cited in
(13)- Finding a length-constrained maximum-density path in a tree
- Attack and defense in the layered cyber-security model and their \((1 \pm \varepsilon)\)-approximation schemes
- Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees
- The density maximization problem in graphs
- Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths
- Exact and Approximation Algorithms for the Expanding Search Problem
- Algorithms and Computation
- Algorithms and Computation
- Bicriterial approximation for the incremental prize-collecting Steiner-tree problem
- Multi-points cyber defense \((1+\epsilon )\) and \((1+\epsilon )^{k-k'}\)-approximation
- Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence
- An improved algorithm for finding a length-constrained maximum-density subtree in a tree
- An optimal algorithm for the maximum-density path in a tree
This page was built for publication: Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q865758)
