A new linear storage, polynomial-time approximation scheme for the subset-sum problem
type: Item
instance of: scholarly article
title: A new linear storage, polynomial-time approximation scheme for the subset-sum problem
zbMATH Open document ID: 0679.68077
DOI: 10.1016/0166-218X(90)90021-4
author: Matteo Fischetti
published in: Discrete Applied Mathematics
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4114001
zbMATH Keywords: polynomial approximation schemes
zbMATH Keywords: computational analysis
zbMATH Keywords: subset-sum
MaRDI profile type: Publication
cites work: Time bounds for selection
cites work: Worst-case analysis of an approximation scheme for the subset-sum problem
cites work: Q4198056
cites work: Q3888846
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Approximation algorithms for combinatorial problems
cites work: Fast Approximation Algorithms for Knapsack Problems
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
full work available at URL: 0166-218x(90)90021-4
OpenAlex ID: W1976791953
description: scientific article; zbMATH DE number 4114001