An efficient fully polynomial approximation scheme for the Subset-Sum problem.
type: Item
instance of: scholarly article
title: An efficient fully polynomial approximation scheme for the Subset-Sum problem.
zbMATH Open document ID: 1045.68157
DOI: 10.1016/S0022-0000(03)00006-0
author: Hans Kellerer
author: Renata Mansini
author: Ulrich Pferschy
author: Maria Grazia Speranza
published in: Journal of Computer and System Sciences
publication date: 2003-08-13T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1963843
zbMATH Keywords: Subset-sum problem
zbMATH Keywords: Worst-case performance
zbMATH Keywords: Fully polynomial approximation scheme
zbMATH Keywords: Knapsack problem
Wikidata QID: Q61638376
describes a project that uses: Knapsack
MaRDI profile type: Publication
cites work: Q3241581
cites work: Hard Knapsack Problems
cites work: Q4886030
cites work: Q4198056
cites work: Q3892056
cites work: Q3888846
cites work: A Fast Approximation Algorithm For The Subset-Sum Problem
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Q4148017
cites work: A new fully polynomial time approximation scheme for the Knapsack problem
cites work: Improved dynamic programming in connection with an FPTAS for the knapsack problem
cites work: Q4370212
cites work: Fast Approximation Algorithms for Knapsack Problems
cites work: A fully polynomial approximation algorithm for the 0-1 knapsack problem
cites work: Worst-case analysis of greedy algorithms for the subset-sum problem
cites work: Approximation schemes for the subset-sum problem: Survey and experimental analysis
cites work: Q3993418
cites work: Linear Time Algorithms for Knapsack Problems with Bounded Weights
description: scientific article; zbMATH DE number 1963843