Skip to main content
SpringerLink
Log in

On finding all solutions of the partitioning problem

  • Communications
  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975 (MFCS 1975)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 32))

  • 1867 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Karp, R.M., Reducibility among combinatorial problems. Complexity of Computer Computation. Plenum Press, New York, 1972.

    Google Scholar 

  2. Sahni, K.S., On the knapsack and other related problems. Ph.D.-Thesis. Cornell University, 1973

    Google Scholar 

  3. Johnson, D.S., Approximation algorithms for combinatorial problems. Proceedings of 5th ACM Symposium on Theory of Complexity, Austin, 1973.

    Google Scholar 

  4. Perl, J., On algorithms for the partitioning problem. Technical report Nr. 75-9 TU-Berlin, Fachbereich 20, Berlin, 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Universität Berlin FB 20, Informationsverarbeitung II, Otto-Suhr-Allee 18–20, 1 Berlin 10

    Jürgen Perl

Authors
  1. Jürgen Perl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jíří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Perl, J. (1975). On finding all solutions of the partitioning problem. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975. MFCS 1975. Lecture Notes in Computer Science, vol 32. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07389-2_218

Download citation

  • DOI: https://doi.org/10.1007/3-540-07389-2_218

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07389-5

  • Online ISBN: 978-3-540-37585-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation