On the average time complexity of set partitioning
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.
KeywordsConjunctive Normal Form Boolean Formula Average Running Time Satisfiability Problem Input Collection
Unable to display preview. Download preview PDF.
- E. Balas and M. Padberg. Set Partitioning — A Survey. in: Combinatorial Optimization, Christofides et al., eds., Wiley, Chichester, 1979Google Scholar
- M.R. Garey and D.S. Johnson. Computers and Intractability — A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979Google Scholar
- A. Goldberg, P. Purdom, and C. Brown. Average time analysis of simplified Davis-Putnam procedures. Inform. Process. Letters, 15, 72–75, 1982Google Scholar
- R. Kemp. Manuscript. 1989Google Scholar
- B. Monien, E. Speckenmeyer, and O. Vornberger. Upper bounds for covering problems. Methods of Operations research, 43, 419–431, 1982Google Scholar
- P.W. Purdom and C.A. Brown. An analysis of backtracking with search rearrangement. SIAM J. Computing, 12, 717–733, 1983Google Scholar
- 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, 1988Google Scholar
- H.S. Wilf. Some examples of combinatorial averaging. The American Math. Monthly, 92, 250–261, 1985Google Scholar