On finding all solutions of the partitioning problem

  • Jürgen Perl
Part of the Lecture Notes in Computer Science book series (LNCS, volume 32)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Karp, R.M., Reducibility among combinatorial problems. Complexity of Computer Computation. Plenum Press, New York, 1972.Google Scholar
  2. 2.
    Sahni, K.S., On the knapsack and other related problems. Ph.D.-Thesis. Cornell University, 1973Google Scholar
  3. 3.
    Johnson, D.S., Approximation algorithms for combinatorial problems. Proceedings of 5th ACM Symposium on Theory of Complexity, Austin, 1973.Google Scholar
  4. 4.
    Perl, J., On algorithms for the partitioning problem. Technical report Nr. 75-9 TU-Berlin, Fachbereich 20, Berlin, 1975.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • Jürgen Perl
    • 1
  1. 1.Technische Universität Berlin FB 20, Informationsverarbeitung II1 Berlin 10

Personalised recommendations