Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- 1 October 1975
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 22 (4), 463-468
- https://doi.org/10.1145/321906.321909
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Approximate Algorithms for the 0/1 Knapsack ProblemJournal of the ACM, 1975
- Computing Partitions with Applications to the Knapsack ProblemJournal of the ACM, 1974
- Approximation algorithms for combinatorial problemsPublished by Association for Computing Machinery (ACM) ,1973
- Some related problems from network flows, game theory and integer programmingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1972
- Reducibility among Combinatorial ProblemsPublished by Springer Science and Business Media LLC ,1972