The Time Complexity of A* with Approximate Heuristics on Multiple-Solution Search Spaces

DOI10.1613/jair.3779zbMath1253.68297OpenAlexW1603992652MaRDI QIDQ4899134

Hang Dinh, Hieu T. Dinh, Alexander Russell, Laurent Michel

Publication date: 7 January 2013

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.3779

zbMATH Keywords

upper boundsheuristicsknapsack problemsearch algorithmspartial Latin square problemtime complexity of \(A^*\) search on trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

This page was built for publication: The Time Complexity of A* with Approximate Heuristics on Multiple-Solution Search Spaces