A fully polynomial approximation algorithm for the 0-1 knapsack problem (Q1159134): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q1051421 |
||
| Property / author | |||
| Property / author: Michael J. Magazine / rank | |||
Revision as of 02:06, 22 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fully polynomial approximation algorithm for the 0-1 knapsack problem |
scientific article |
Statements
A fully polynomial approximation algorithm for the 0-1 knapsack problem (English)
0 references
1981
0 references
0-1 knapsack problem
0 references
polynomial epsilon-approximation algorithm
0 references
NP- complete problem
0 references
