Advertisement

Analytical Results on the BFS vs. DFS Algorithm Selection Problem: Part II: Graph Search

Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9457)

Abstract

The algorithm selection problem asks to select the best algorithm for a given problem. In the companion paper (Everitt and Hutter 2015b), expected runtime was approximated as a function of search depth and probabilistic goal distribution for tree search versions of breadth-first search (BFS) and depth-first search (DFS). Here we provide an analogous analysis of BFS and DFS graph search, deriving expected runtime as a function of graph structure and goal distribution. The applicability of the method is demonstrated through analysis of two different grammar problems. The approximations come surprisingly close to empirical reality.

Keywords

Algorithm Selection Problem Graph Search Grammar Problem Distributional Goals Hutter 2015b 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Notes

Acknowledgements

Thanks to David Johnston for proof reading final drafts of both papers.

References

  1. Edelkamp, S., Schrödl, S.: Heuristic Search. Morgan Kaufmann Publishers Inc, San Francisco (2012)zbMATHGoogle Scholar
  2. Everitt, T., Hutter, M.: A topological approach to Meta-heuristics: analytical results on the BFS vs. DFS algorithm selection problem. Technical report, Australian National University. arXiv:1509.02709[cs.AI] (2015a)
  3. Everitt, T., Hutter, M.: Analytical results on the BFS vs. DFS algorithm selection problem. In: 28th Australian Joint Conference on Artificial Intelligence, Part I: Tree Search (2015b)Google Scholar
  4. Hutter, F., Xu, L., Hoos, H.H., Leyton-Brown, K.: Algorithm runtime prediction: methods and evaluation. Artif. Intell. 206(1), 79–111 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  5. Knuth, D.E.: Estimating the efficiency of backtrack programs. Math. Comput. 29(129), 122–122 (1975)MathSciNetCrossRefzbMATHGoogle Scholar
  6. Korf, R.E., Reid, M., Edelkamp, S.: Time complexity of iterative-deepening-A*. Artif. Intell. 129(1–2), 199–218 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  7. Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. AI Magazine, pp. 1–17 (2014)Google Scholar
  8. Legg, S., Hutter, M.: Universal intelligence. Minds Mach. 17(4), 391–444 (2007)CrossRefGoogle Scholar
  9. Pearl, J.: Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, Boston (1984)Google Scholar
  10. Peixoto, T.P.: The graph-tool python library. figshare (2015)Google Scholar
  11. Rice, J.R.: The algorithm selection problem. Adv. Comput. 15, 65–117 (1975)CrossRefGoogle Scholar
  12. Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach, 3rd edn. Prentice Hall, Upper Saddle River (2010)zbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Australian National UniversityCanberraAustralia

Personalised recommendations

Cite paper

Buy options