Improved dynamic programming in connection with an FPTAS for the knapsack problem (Q1768594)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2146072
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved dynamic programming in connection with an FPTAS for the knapsack problem |
scientific article; zbMATH DE number 2146072 |
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
0.8091463446617126
0 references
0.7777799963951111
0 references
