On the Complexity of Searching in Trees: Average-Case Minimization

DOI10.1007/978-3-642-14165-2_45zbMath1288.68125OpenAlexW1932722758MaRDI 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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Improved approximation algorithms for the average-case tree searching problem ⋮ On the Huffman and alphabetic tree problem with general cost functions ⋮ The binary identification problem for weighted trees

This page was built for publication: On the Complexity of Searching in Trees: Average-Case Minimization