A combinatorial structure ensuring applicability of the dynamic programming method (Q918440)
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: A combinatorial structure ensuring applicability of the dynamic programming method |
scientific article; zbMATH DE number 4158409
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A combinatorial structure ensuring applicability of the dynamic programming method |
scientific article; zbMATH DE number 4158409 |
Statements
A combinatorial structure ensuring applicability of the dynamic programming method (English)
0 references
1989
0 references
matroid
0 references
branching greedy algorithm
0 references
shortest path algorithm
0 references
fibroid
0 references
0.8682311
0 references
0.86545837
0 references
0.86397606
0 references
0.8633461
0 references
0.85295767
0 references
0.8514511
0 references
