Worst-case analysis of an approximation scheme for the subset-sum problem
type: Item
instance of: scholarly article
title: Worst-case analysis of an approximation scheme for the subset-sum problem
zbMATH Open document ID: 0618.90080
DOI: 10.1016/0167-6377(86)90065-9
author: Matteo Fischetti
published in: Operations Research Letters
publication date: 1986-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4003925
zbMATH Keywords: Subset-Sum problem
zbMATH Keywords: polynomial approximation scheme
zbMATH Keywords: worst-case performance
MaRDI profile type: Publication
full work available at URL: 0167-6377(86)90065-9
OpenAlex ID: W2055529705
cites work: Q4198056
cites work: Worst-case analysis of greedy algorithms for the subset-sum problem
Recommended article: Q4866340
Recommended article: Approximation schemes for the subset-sum problem: Survey and experimental analysis
Recommended article: Q4370212
Recommended article: Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems
Recommended article: Worst-case analysis of the subset sum algorithm for bin packing.
Recommended article: Approximation schemes for subset sum ratio problems
Recommended article: Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations
Recommended article: Approximation schemes for subset-sums ratio problems
Recommended article: A Fast Approximation Algorithm For The Subset-Sum Problem
Recommended article: A Fast Approximation Algorithm for the Subset-sum Problem
description: scientific article; zbMATH DE number 4003925