The following pages link to MAVG (Q22870):
Displaying 9 items.
- Cache oblivious algorithms for the RMQ and the RMSQ problems (Q626901) (← links)
- Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence (Q955012) (← links)
- On locating disjoint segments with maximum sum of densities (Q1024216) (← links)
- Fast algorithms for the density finding problem (Q1024779) (← links)
- Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint (Q1044737) (← links)
- Finding a length-constrained maximum-density path in a tree (Q1781798) (← links)
- Finding a maximum-density path in a tree under the weight and length constraints (Q2380075) (← links)
- On the range maximum-sum segment query problem (Q2384388) (← links)
- Improved algorithms for the \(k\) maximum-sums problems (Q2508973) (← links)
