Pages that link to "Item:Q2509030"
From MaRDI portal
The following pages link to Efficient algorithms for \(k\) maximum sums (Q2509030):
Displaying 12 items.
- Linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence (Q501652) (← links)
- Randomized algorithm for the sum selection problem (Q884471) (← links)
- Ranking \(k\) maximum sums (Q884477) (← links)
- Fast algorithms for the maximum convolution problem (Q1332943) (← links)
- Efficient algorithms for the maximum sum problems (Q1662587) (← links)
- Robust optimization in the presence of uncertainty: a generic approach (Q1745727) (← links)
- Minimizing the sum of the \(k\) largest functions in linear time. (Q1853685) (← links)
- Efficient algorithms for the sum selection problem and \(k\) maximum sums problem (Q2268857) (← links)
- Improved algorithms for the \(k\) maximum-sums problems (Q2508973) (← links)
- MINKOWSKI SUM SELECTION AND FINDING (Q3089093) (← links)
- Maximizing Range Sum in External Memory (Q5012499) (← links)
- Algorithms and Computation (Q5712105) (← links)