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.

• Type: Journal
• Year: 2002
• Where: ENTCS
• Authors: Tadao Takaoka
• Keywords: Algorithm, ENTCS 2002, Promising Array Portion, Worst Case