FAQ

Maximum subarray problem

Known as: Kadane's Algorithm, Kadane’s Algorithm 
In computer science, the maximum subarray problem is the task of finding the contiguous subarray within a one-dimensional array of numbers which has… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2002-2016
01220022016

Related topics

Related topics

7 relations
AlgorithmArray data structureCommunications of the ACMComputer science
(More)

Broader (1)

Dynamic programming

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Maximum subarray problem
Algorithm
Computer science
Dynamic programming
Python
Communications of the ACM

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Tight Hardness Results for Maximum Weight Rectangles
Given n weighted points (positive or negative) in d dimensions, what is the axis-aligned box which maximizes the total weight of… (More)
  • table 1
Is this relevant?
2014
2014
Efficient Parallel Algorithms for the Maximum Subarray Problem
Parallel algorithm design is generally hard. Parallel program verification is even harder. We take an example from the maximum… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
Is this relevant?
2013
2013
Maximum subarray algorithms for use in astronomical imaging
The maximum subarray problem is used to identify the subarray of a two dimensional array, where the sum of elements is maximized… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
High performance CUDA-based implementation for the 2D version of the Maximum Subarray Problem (MSP)
The Maximum Subarray Problem (MSP) finds a segment of an array that has the maximum summation over all the other possible… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem
The maximum subarray problem (MSP) involves selection of a segment of consecutive array elements that has the largest possible… (More)
  • figure 2.2
  • figure 3.1
  • figure 3.6
  • figure 3.10
  • figure 4.5
Is this relevant?
2007
2007
A Sub-cubic Time Algorithm for the k -Maximum Subarray Problem
We design a faster algorithm for the k-maximum sub-array problem under the conventional RAM model, based on distance matrix… (More)
Is this relevant?
2006
2006
Improved Algorithms for the K-Maximum Subarray Problem
Themaximum subarray problem is to find the contiguous array elements having the largest possible sum. We extend this problem to… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2006
2006
Algorithm for K Disjoint Maximum Subarrays
The maximum subarray problem is to find the array portion that maximizes the sum of array elements in it. For K disjoint maximum… (More)
  • figure 1
  • figure 3
Is this relevant?
2005
2005
Improved Algorithms for the K-Maximum Subarray Problem for Small K
The maximum subarray problem for a oneor two-dimensional array is to find the array portion that maiximizes the sum of array… (More)
Is this relevant?
2002
2002
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… (More)
Is this relevant?