On the Complexity of Searching in Trees: Average-Case Minimization
From MaRDI portal
Publication:3587405
DOI10.1007/978-3-642-14165-2_45zbMath1288.68125MaRDI QIDQ3587405
Ferdinando Cicalese, Marco Molinaro, Tobias Jacobs, Eduardo Sany Laber
Publication date: 7 September 2010
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14165-2_45
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Improved approximation algorithms for the average-case tree searching problem, The binary identification problem for weighted trees, On the Huffman and alphabetic tree problem with general cost functions