A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem (Q4376743): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 15:35, 5 March 2024
scientific article; zbMATH DE number 1117848
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
