Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence (Q396653)
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: Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence |
scientific article; zbMATH DE number 6329899
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence |
scientific article; zbMATH DE number 6329899 |
Statements
Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence (English)
0 references
13 August 2014
0 references
maximum scoring subsequence
0 references
maximum sum problem
0 references
insertion in a sequence
0 references
maximum renewal cumulative cost
0 references
0.8617584
0 references
0.83699006
0 references
0.8343346
0 references
0.8293381
0 references
0.8290739
0 references
0.8268206
0 references
0.82598126
0 references
0.8257258
0 references
0 references
