An efficient approximation scheme for the subset-sum problem
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 394-403
- https://doi.org/10.1007/3-540-63890-3_42
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Fast approximation algorithms for knapsack type problemsPublished by Springer Nature ,2005
- An efficient approximation scheme for the subset-sum problemPublished by Springer Nature ,1997
- 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