Improved Approximation Algorithms for the Average-Case Tree Searching Problem
- 16 November 2012
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 68 (4) , 1045-1074
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- On the complexity of searching in trees and partially ordered structuresTheoretical Computer Science, 2011
- Decision trees for entity identificationACM Transactions on Algorithms, 2011
- Sorting and Selection in PosetsSIAM Journal on Computing, 2011
- On Greedy Algorithms for Decision Trees2010
- Approximating Optimal Binary Decision Trees2008
- Lower bounds for asymmetric communication channels and distributed source coding2006
- Code and parse trees for lossless source encoding2002
- Protocols for Asymmetric Communication ChannelsJournal of Computer and System Sciences, 2001
- Optimal Search in TreesSIAM Journal on Computing, 1999
- Decision Trees for Geometric ModelsInternational Journal of Computational Geometry & Applications, 1998