A new fully polynomial time approximation scheme for the Knapsack problem (Q1304384)
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 1339728
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new fully polynomial time approximation scheme for the Knapsack problem |
scientific article; zbMATH DE number 1339728 |
Statements
A new fully polynomial time approximation scheme for the Knapsack problem (English)
0 references
22 September 1999
0 references
knapsack problem
0 references
fully polynomial approximation scheme
0 references
0.8835470080375671
0 references
0.8336939215660095
0 references
0.8336628675460815
0 references
