An improved algorithm for finding a length-constrained maximum-density subtree in a tree
From MaRDI portal
(Redirected from Publication:975556)
Recommendations
- Algorithms and Computation
- Finding a length-constrained maximum-density path in a tree
- Algorithms and Computation
- Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics
- An improved algorithm for the maximum agreement subtree problem
- An optimal algorithm for the maximum-density path in a tree
- A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree
- Optimizing constrained subtrees of trees
- Revisiting dynamic programming for finding optimal subtrees in trees
- scientific article; zbMATH DE number 3959487
Cites work
- Algorithms and Computation
- 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
- Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics
- Finding a maximum-density path in a tree under the weight and length constraints
- scientific article; zbMATH DE number 3639144 (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
(12)- 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
- Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance
- An Analysis of a Good Algorithm for the Subtree Problem, Corrected
- Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths
- Algorithms and Computation
- Algorithms and Computation
- Multi-points cyber defense \((1+\epsilon )\) and \((1+\epsilon )^{k-k'}\)-approximation
- Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics
- Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees
- A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree
- An optimal algorithm for the maximum-density path in a tree
This page was built for publication: An improved algorithm for finding a length-constrained maximum-density subtree in a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975556)
