MAVG
From MaRDI portal
Cited in
(10)- On locating disjoint segments with maximum sum of densities
- Fast algorithms for the density finding problem
- Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint
- Finding a length-constrained maximum-density path in a tree
- Finding a maximum-density path in a tree under the weight and length constraints
- On the range maximum-sum segment query problem
- Improved algorithms for the \(k\) maximum-sums problems
- SEGID
- Cache oblivious algorithms for the RMQ and the RMSQ problems
- Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence
This page was built for software: MAVG
