Live briefing
Everything about Maximum subarray problem
Problem in computer science
In computer science, the maximum sum subarray problem, also known as the maximum segment sum problem, is the task of finding a contiguous subarray with the largest sum, within a given one-dimensional array A[1...n] of numbers. It can be solved in time and space. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Maximum subarray problemA 5-minute orientation
- Read the landmark paper: Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix MultiplicationCited 38 times
- Go sideways: Interpolation sortA closely related topic
- Go sideways: Semidefinite programmingA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication
Improved Algorithms for the K-Maximum Subarray Problem
Two Kadane Algorithms for the Maximum Sum Subarray Problem
Algorithms for the Maximum Subarray Problem Based on Matrix Multiplication.
MAXIMUM SUBARRAY PROBLEM OPTIMIZATION FOR SPECIFIC DATA
📚 Books worth reading
Open Library didn't respond; try again in a moment.
🔗 Related topics
- Interpolation sort Interpolation sort (or histogram sort) is a sorting algorithm that uses an interpolation formula to divide and conquer. It is a variant of bucket sort…
- Semidefinite programming Semidefinite programming (SDP) is a subfield of mathematical programming concerned with the optimization of a linear objective function (a user-specified…
- Constrained optimization In mathematical optimization, constrained optimization (in some contexts called constraint optimization) is the process of optimizing an objective function…
- Quadratic knapsack problem The quadratic knapsack problem (QKP), first introduced in 19th century, is an extension of knapsack problem that allows for quadratic terms in the objective…
- Duality (optimization) In mathematical optimization theory, duality or the duality principle is the principle that optimization problems may be viewed from either of two perspectives…
- Longest increasing subsequence In computer science, the longest increasing subsequence problem aims to find a subsequence of a given sequence in which the subsequence's elements are…
- Drift plus penalty In the mathematical theory of probability, the drift-plus-penalty method is used for optimization of queueing networks and other stochastic systems. The…
- David Shmoys David Bernard Shmoys (born 1959) is a Professor in the School of Operations Research and Information Engineering and the Department of Computer Science…