On the complexity of branch-and-bound search for random trees

Random Structures and Algorithms

Volumn 14, Issue 4, 1999, Pages 309-327

  Devroye, Luc ^a   Zamora Cura, Carlos ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

Branch and bound; Expected complexity; Lower bounds; Probabilistic analysis; Search algorithms; Tree search

Indexed keywords

EID: 0033413710     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199907)14:4<309::AID-RSA2>3.0.CO;2-1     Document Type: Article

References (18)

1. S. Asmussen and H. Hering, Branching processes, Birkhäuser, Boston, 1983.
2. K.B. Athreya and P.E. Ney, Branching processes, Springer-Verlag, Berlin, 1972.
3. J.D. Biggins, Chernoff's theorem in the branching random walk, J Appl Probab 14 (1977), 630-636.
4. C.A. Brown and P.W. Purdom, An average time analysis of backtracking, SIAM J Comput 10 (1981), 583-593.
5. J.M. Hammersley, Postulates for subadditive processes, Ann Probab 2 (1974), 652-680.
6. T.E. Harris, The theory of branching processes, Springer-Verlag, Berlin, 1963.
7. R.M. Karp and J. Pearl, Searching for an optimal path in a tree with random costs Artif Intell 21 (1983), 99-117.
8. J.F.C. Kingman, The first-birth problem for an age-dependant branching process, Ann Probab 3 (1975), 341-345.
9. V. Kumar, Search, branch and bound, Encyclopedia of artificial intellilgence, 2nd edition, S.C. Shapiro (Editor), Wiley-Interscience, New York, 1992, pp. 1468-1472.
10. C.J.H. McDiarmid, Probabilistic analysis of tree search, Disorder in physical systems, D.J.A. Welsh and G.R. Grimmett (Editors), Clarendon Press, Oxford, Oxford University Press, New York, 1990, pp. 249-260.
11. C.J.H. McDiarmid and G.M.A. Provan, An expected-cost analysis of backtracking and non-backtracking algorithms, IJCAI-91: Proc twelfth international conference on artificial intelligence, Morgan Kaufmann Publishing, San Mateo, CA, 1991, pp. 172-177.
12. J. Pearl, Heuristics: intelligent search strategies for computer problem solving, Addison-Wesley, Reading, MA, 1984.
13. P.W. Purdom, Search rearrangement backtracking and polynomial average time, Artif Intell 21 (1983), 117-133.
14. E.M. Reingold, J. Nievergelt, and N. Deo, Combinatorial algorithms: theory and practice, Prentice Hall, Englewood Cliffs, NJ, 1977.
15. D.R. Smith, Random trees and the analysis of branch and bound procedures, J ACM 31 (1984), 163-188.
16. H.S. Stone and P. Sipala, The average complexity of depth-first search with backtracking and cutoff, IBM J Res Dev 30 (1986), 242-258.
17. B.W. Wah and C.F. Yu, Stochastic modeling of branch-and-bound algorithms with best-first search, IEEE Trans Software Eng SE-11 (1985), 922-934.
18. W. Zhang and R.E. Korf, An average-case analysis of branch-and-bound with applications, Proc 10th National Conference on AI - AAAI-92, San Jose, CA, 1992, pp. 1-6.