Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

Journal of the ACM (JACM)

Volumn 22, Issue 4, 1975, Pages 463-468

  Ibarra, Oscar H ^a   Kim, Chul E ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

approximation algorithm; knapsack problem; P complete problem; polynomial time algorithm; sum of subset problem

Indexed keywords

MATHEMATICAL TECHNIQUES - COMBINATORIAL MATHEMATICS;

MATHEMATICAL PROGRAMMING;

EID: 0016560084     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/321906.321909     Document Type: Article

References (11)

1. Cook, S. A. The complexity of theorem proving procedures. Conf. Record of Third ACM Symp on Theory of Computing, 1970, pp. 151-158.
2. Horowitz, E., and Sahni, S. Computing partitions with applications to the knapsack problem J ACM 21, 2 (April 1974), 277-292.
3. Ingargiola, G. P., and Korsh, J F. A reduction algorithm for zero-one single knapsack problems. Manag. Sci 20 (1973), 460-463.
4. Johnson, D. Approximation algorithms for combinatorial problems Proc. of the Fifth Annual ACM Symp on Theory of Computing, 1973, pp 38-49.
5. Karp, R. Reducibility among combinatorial problems. In Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds, Plenum Press, N. Y., 1972, pp 85-104.
6. Kolesar, P. J. A branch and bound algorithm for the knapsack problem Manag Sci 13 (1967), 723-735.
7. Nemhauser, G L., and Garfinkel, R. Integer Programming Wiley, New York, 1972.
8. Nemhauser, G. L., and Ullman, Z Discrete dynamic programming and capital allocation Manag. Sci 15 (1969), 494-505.
9. Sahni, S Some related problems from network flows, game theory, and integer programming Proc of the 13th Annual IEEE Symp on Switching and Automata Theory, 1972, pp 130-138.
10. Sahni, S. Approximate algorithms for the 0/1 knapsack problem J. ACM 22, 1 (Jan 1975), 115-124.
11. Sahni, S., and Gonzales, T. P-complete problems and approximate solutions Comput. Sci Tech. Rep. 74-5, U. of Minnesota, Minneapolis, Minn., 1974.