A Fast Approximation Algorithm For The Subset-Sum Problem (Q4313818)
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 696984
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Fast Approximation Algorithm For The Subset-Sum Problem |
scientific article; zbMATH DE number 696984 |
Statements
A Fast Approximation Algorithm For The Subset-Sum Problem (English)
0 references
29 November 1994
0 references
subset-sum-problem
0 references
NP-hard
0 references
polynomial approximation scheme
0 references
scaling method
0 references
knapsack problem
0 references
0.918594241142273
0 references
0.9058300852775574
0 references
0.9058300852775574
0 references
0.8946497440338135
0 references
