Randomized algorithm for the sum selection problem
Theoretical Computer Science
Efficient algorithms for the sum selection problem and k maximum sums problem
Theoretical Computer Science
A sub-cubic time algorithm for the k-maximum subarray problem
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Effect of corner information in simultaneous placement of K rectangles and tableaux
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Improved algorithms for the K-maximum subarray problem for small K
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Algorithms for computing the maximum weight region decomposable into elementary shapes
Computer Vision and Image Understanding
A linear time algorithm for the k maximal sums problem
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Robust optimization in the presence of uncertainty
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |
The maximum subarray problem is to find the contiguous array elements having the largest possible sum. We extend this problem to find K maximum subarrays. For general K maximum subarrays where overlapping is allowed, Bengtsson and Chen presented $$O\left(\mathit{min}\right\{K+n{\hbox{ log }}^{2}n,n\sqrt{K}\left\}\right)$$ time algorithm for one-dimensional case, which finds unsorted subarrays. Our algorithm finds K maximum subarrays in sorted order with improved complexity of O ((n + K) log K). For the two-dimensional case, we introduce two techniques that establish O(n3) and subcubic time.