A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem (Q4376743)
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 Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem |
scientific article; zbMATH DE number 1117848
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem |
scientific article; zbMATH DE number 1117848 |
Statements
A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem (English)
0 references
26 November 1998
0 references
tree knapsack problem
0 references
pseudopolynomial-time algorithm
0 references
0.7895976305007935
0 references
0.7863136529922485
0 references
