Improved dynamic programming in connection with an FPTAS for the knapsack problem (Q1768594): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q61638367, #quickstatements; #temporary_batch_1707216511891 |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:37, 5 March 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
