An efficient fully polynomial approximation scheme for the Subset-Sum problem. (Q1400576)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient fully polynomial approximation scheme for the Subset-Sum problem. |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient fully polynomial approximation scheme for the Subset-Sum problem. |
scientific article |
Statements
An efficient fully polynomial approximation scheme for the Subset-Sum problem. (English)
0 references
13 August 2003
0 references
Subset-sum problem
0 references
Worst-case performance
0 references
Fully polynomial approximation scheme
0 references
Knapsack problem
0 references
