ALGORITHMS FOR K-DISJOINT MAXIMUM SUBARRAYS (Q3434278)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: ALGORITHMS FOR K-DISJOINT MAXIMUM SUBARRAYS |
scientific article; zbMATH DE number 5145770
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | ALGORITHMS FOR K-DISJOINT MAXIMUM SUBARRAYS |
scientific article; zbMATH DE number 5145770 |
Statements
ALGORITHMS FOR K-DISJOINT MAXIMUM SUBARRAYS (English)
0 references
25 April 2007
0 references
maximum subarray problem
0 references
ranking \(K\) maximum sums
0 references
disjoint sets
0 references
union/find problem
0 references
0 references
0.9754581451416016
0 references
0.8845670819282532
0 references
0.8313814401626587
0 references
0.8281258940696716
0 references
0.827811062335968
0 references
