Efficient algorithms for the sum selection problem and \(k\) maximum sums problem (Q2268857)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5678861
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for the sum selection problem and \(k\) maximum sums problem |
scientific article; zbMATH DE number 5678861 |
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
0 references
0.997776746749878
0 references
0.9249927997589112
0 references
0.8911026120185852
0 references
0.872732937335968
0 references
0.8686266541481018
0 references
