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

  • Authors:

  • Matteo Fischetti

  • Affiliations:

  • DEIS University of Bologna, Viale Riso-gimento 2, 40136 Bologna, Italy

  • Venue:
  • Operations Research Letters
  • Year:
  • 1986

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.