Worst-case analysis of greedy algorithms for the subset-sum problem
- 1 February 1984
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 28 (2) , 198-205
- https://doi.org/10.1007/bf02612360
Abstract
No abstract availableKeywords
This publication has 6 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 Heuristic AlgorithmsManagement Science, 1980
- 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
- Approximate Algorithms for the 0/1 Knapsack ProblemJournal of the ACM, 1975