Skip to main content
SpringerLink
Log in

On the average time complexity of set partitioning

  • Conference paper
  • First Online:
CSL '89 (CSL 1989)

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

Included in the following conference series:

Abstract

The average running time of backtracking for solving the set-partitioning problem under two probability models, the constant set size model and the constant occurence model, will be studied. Results separating classes of instances with an exponential from such with a polynomial running time in the average will be shown.

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.

6. References

  1. E. Balas and M. Padberg. Set Partitioning — A Survey. in: Combinatorial Optimization, Christofides et al., eds., Wiley, Chichester, 1979

    Google Scholar 

  2. M.R. Garey and D.S. Johnson. Computers and Intractability — A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979

    Google Scholar 

  3. A. Goldberg, P. Purdom, and C. Brown. Average time analysis of simplified Davis-Putnam procedures. Inform. Process. Letters, 15, 72–75, 1982

    Google Scholar 

  4. R. Kemp. Manuscript. 1989

    Google Scholar 

  5. B. Monien, E. Speckenmeyer, and O. Vornberger. Upper bounds for covering problems. Methods of Operations research, 43, 419–431, 1982

    Google Scholar 

  6. P.W. Purdom and C.A. Brown. An analysis of backtracking with search rearrangement. SIAM J. Computing, 12, 717–733, 1983

    Google Scholar 

  7. E. Speckenmeyer. Classes of CNF-formulas with backtracking trees of exponential or linear average order for exact-satisfiability. Proc. MFCS '88, Lecture Notes Comput. Sci. 324, 529–537, Springer-Verlag, Berlin, 1988

    Google Scholar 

  8. H.S. Wilf. Some examples of combinatorial averaging. The American Math. Monthly, 92, 250–261, 1985

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FB Informatik, Universität Dortmund, Germany

    Ewald Speckenmeyer

  2. FB Informatik, Universität Frankfurt/M, Germany

    Rainer Kemp

Authors
  1. Ewald Speckenmeyer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rainer Kemp
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Hans Kleine Büning Michael M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Speckenmeyer, E., Kemp, R. (1990). On the average time complexity of set partitioning. In: Börger, E., Büning, H.K., Richter, M.M. (eds) CSL '89. CSL 1989. Lecture Notes in Computer Science, vol 440. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52753-2_51

Download citation

  • DOI: https://doi.org/10.1007/3-540-52753-2_51

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52753-4

  • Online ISBN: 978-3-540-47137-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation