Fast Approximation Algorithms for Knapsack Problems (Q3861164): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:54, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast Approximation Algorithms for Knapsack Problems |
scientific article |
Statements
Fast Approximation Algorithms for Knapsack Problems (English)
0 references
1979
0 references
NP-complete problems
0 references
knapsack problem
0 references
subset sum problem
0 references
fully polynomial approximation schemes
0 references
approximate solution
0 references
