Worst-case analysis of an approximation scheme for the subset-sum problem (Q1089266): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(86)90065-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2055529705 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Worst-case analysis of greedy algorithms for the subset-sum problem / rank | |||
Normal rank | |||
Latest revision as of 18:53, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Worst-case analysis of an approximation scheme for the subset-sum problem |
scientific article |
Statements
Worst-case analysis of an approximation scheme for the subset-sum problem (English)
0 references
1986
0 references
Given a set of n positive integers, the Subset-Sum problem is to find that subset whose sum is closest to, without exceeding, a given integer W. In this paper we analyse Martello and Toth's polynomial approximation scheme [see \textit{S. Martello} and \textit{P. Toth}, Math. Program. 28, 198- 205 (1984; Zbl 0527.90027)] for the problem, showing that its worst-case performance is better than the lower bound they proved, although not so good as conjectured.
0 references
Subset-Sum problem
0 references
polynomial approximation scheme
0 references
worst-case performance
0 references
