Sciweavers

COCOON
2005
Springer
14 years 6 months ago
Improved Algorithms for the K-Maximum Subarray Problem for Small K
The maximum subarray problem for a one- or two-dimensional array is to find the array portion that maiximizes the sum of array elements in it. The K-maximum subarray problem is to...
Sung Eun Bae, Tadao Takaoka