Efficient algorithms for the sum selection problem and \(k\) maximum sums problem
From MaRDI portal
Publication:2268857
DOI10.1016/j.tcs.2009.11.005zbMath1186.68545MaRDI QIDQ2268857
Publication date: 9 March 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.11.005
maximum sum problem; sum selection problem; \(k\) maximum sums problem; maximum sum subarray problem
68W05: Nonnumerical algorithms
Cites Work
- Unnamed Item
- Randomized algorithm for the sum selection problem
- A note on a standard strategy for developing loop invariants and loops
- Sorting in \(c \log n\) parallel steps
- Optimal slope selection via cuttings
- Applications of a strategy for designing divide-and-conquer algorithms
- Improved algorithms for the \(k\) maximum-sums problems
- Efficient algorithms for \(k\) maximum sums
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- An Optimal-Time Algorithm for Slope Selection
- APPLICATION OF BROADCASTING WITH SELECTIVE REDUCTION TO THE MAXIMAL SUM SUBSEGMENT PROBLEM
- Slowing down sorting networks to obtain faster sorting algorithms