Worst-case analysis of an approximation scheme for the subset-sum problem
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.
scientific article; zbMATH DE number 4003925