Improved dynamic programming in connection with an FPTAS for the knapsack problem (Q1768594): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:30, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved dynamic programming in connection with an FPTAS for the knapsack problem |
scientific article |
Statements
Improved dynamic programming in connection with an FPTAS for the knapsack problem (English)
0 references
15 March 2005
0 references
dynamic programming
0 references
knapsack problem
0 references
fully polynomial approximation scheme
0 references
