A new linear storage, polynomial-time approximation scheme for the subset-sum problem
- 31 January 1990
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 26 (1) , 61-77
- https://doi.org/10.1016/0166-218x(90)90021-4
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- Fast approximation algorithms for knapsack type problemsPublished by Springer Nature ,2005
- Worst-case analysis of an approximation scheme for the subset-sum problemOperations Research Letters, 1986
- Approximation schemes for the subset-sum problem: Survey and experimental analysisEuropean Journal of Operational Research, 1985
- Worst-case analysis of greedy algorithms for the subset-sum problemMathematical Programming, 1984
- Fast Approximation Algorithms for Knapsack ProblemsMathematics of Operations Research, 1979
- Fast Approximation Algorithms for the Knapsack and Sum of Subset ProblemsJournal of the ACM, 1975
- Time bounds for selectionJournal of Computer and System Sciences, 1973
- Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]Communications of the ACM, 1969