Skip to main content
SpringerLink
Log in

Parallel approximation schemes for Subset Sum and Knapsack problems

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

This paper presents parallel approximation schemes for the Subset Sum, 0–1 Knapsack, and several other optimization problems. These algorithms offer a three-way trade-off among parallel time, the accuracy of the solution, and the number of processors used. The maximum numbers of processors which can be usefully employed depend on n (the size of the input), and the accuracy requirement ɛ. The parallel running times of the algorithms are polynomial in both log n and log(1/ɛ) when enough processors are used.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Fortune, S., Wyllie, J.: Parallelism in random access machines. Proc. 10th ACM Symposium on Theory of Computing, May 1978, pp. 114–118

  2. Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. San Francisco: W.H. Freeman 1979

    Google Scholar 

  3. Gens, G.V., Levner, E.V.: Approximate algorithms for certain universal problems in scheduling theory. Izv. Akad. Nauk SSSR, Tech. Kibernet. 16:38–43 (1978)

    Google Scholar 

  4. Gens, G.V., Levner, Ye.V.: Discrete optimization problems and efficient approximate algorithms (A survey). Eng. Cybernetics 17:1–11 (1979)

    Google Scholar 

  5. Gens, G.V., Levner, E.V.: Fast approximation algorithms for knapsack type problems. In: Proc. 9th IFIP Conference on Optimization Techniques, Lecture Notes in Control and Information Sciences, Vol. 23, pp. 185–194. Berlin, Heidelberg, New York: Springer 1979

    Google Scholar 

  6. Gens, G., Levner, E.: Complexity of approximation algorithms for combinatorial problems: a survey. SIGACT News 12:52–65 (1980)

    Google Scholar 

  7. Horowitz, E., Sahni, S.K.: Exact and approximate algorithms for scheduling nonidentical processors. Journal ACM 23:317–327 (1976)

    Google Scholar 

  8. Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subsets problems. J. ACM 22:463–468 (1975)

    Google Scholar 

  9. Lawler, E.L.: Fast approximation algorithms for knapsack problems. Proc. 18th IEEE Symp. Found. Comput. Sci., pp. 206–213. Providence, Rhode Island, Oct 31–Nov 2, 1977

  10. Leighton, T.: Tight bounds on the complexity of parallel sorting. Proc. 16th ACM Symp. Theory Comput., pp. 71–80. Washington, D.C. 1984

  11. Moran, S.: General approximation algorithms for some arithmetical combinatorial problems. Theor. Comput. Sci. 14:289–303 (1981)

    Google Scholar 

  12. Peters, J., Rudolph, L.: Parallel approximation schemes for subset sum and knapsack problems. Dept. of Computer Science, Carnegie-Mellon University, Technical Report CMU-CS-84-155, August 1984

  13. Sahni, S.K.: Algorithms for scheduling independent tasks. Journal ACM 23:116–127 (1976)

    Google Scholar 

  14. Sahni, S.: General techniques for combinatorial approximation. Oper. Res. 25:920–936 (1977)

    Google Scholar 

Download references

Author information

Author notes

  1. Larry Rudolph

    Present address: Institute of Mathematics and Computer Science, The Hebrew University of Jerusalem, Jerusalem, Israel

Authors and Affiliations

  1. School of Computing Science, Simon Fraser University, V5A 1S6, Burnaby, British Columbia, Canada

    Joseph G. Peters

  2. Department of Computer Science, Carnegie-Mellon University, 15213, Pittsburgh, PA, USA

    Larry Rudolph

Authors
  1. Joseph G. Peters
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Larry Rudolph
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Parts of this research were done while both authors were at the Department of Computer Science, University of Toronto

Rights and permissions

Reprints and permissions

About this article

Cite this article

Peters, J.G., Rudolph, L. Parallel approximation schemes for Subset Sum and Knapsack problems. Acta Informatica 24, 417–432 (1987). https://doi.org/10.1007/BF00292111

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00292111

Keywords

Search

Navigation