An efficient fully polynomial approximation scheme for the Subset-Sum problem. (Q1400576): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:14, 5 March 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
