An efficient fully polynomial approximation scheme for the Subset-Sum problem. (Q1400576): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 16:00, 31 January 2024
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