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