Worst-case analysis of an approximation scheme for the subset-sum problem

Given a set of n integers, the Subset-Sum Problem is to find that subset whose sum is closent to, without exceeding, a given integer W. In this paper we analyse Martello and Toth's polynomial approximation scheme for the problem, showing that its worst-case performance is better than the lower bound they proved, although not so good as conjectured.