Sciweavers

Share
ENTCS
2002

Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication

11 years 9 months ago
Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication
We design an efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array. The solution can be used to find the most promising array portion that correlates two parameters involved in data, such as ages and income for the amount of sales per some period. The previous subcubic time algorithm is simplified, and the time complexity is improved for the worst case. We also give a more practical algorithm whose expected time is better than the worst case time.
Tadao Takaoka
Added 18 Dec 2010
Updated 18 Dec 2010
Type Journal
Year 2002
Where ENTCS
Authors Tadao Takaoka
Comments (0)
books