Efficient algorithms for the sum selection problem and \(k\) maximum sums problem (Q2268857): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2009.11.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2164079678 / rank | |||
Normal rank | |||
Revision as of 02:05, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for the sum selection problem and \(k\) maximum sums problem |
scientific article |
Statements
Efficient algorithms for the sum selection problem and \(k\) maximum sums problem (English)
0 references
9 March 2010
0 references
\(k\) maximum sums problem
0 references
sum selection problem
0 references
maximum sum problem
0 references
maximum sum subarray problem
0 references
