Sciweavers

Share
ALGORITHMICA
2011

An Approximation Algorithm for Binary Searching in Trees

8 years 1 months ago
An Approximation Algorithm for Binary Searching in Trees
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find a (unknown) specific node of a tree by asking queries to its arcs, where each query indicates the endpoint closer to the desired node. Given the likelihood of each node being the one searched, the objective is to compute a search strategy that minimizes the expected number of queries. Practical applications of this problem include file system synchronization and software testing. Here we present a linear time algorithm which is the first constant factor approximation for this problem. This represents a significant improvement over previous O(log n)-approximation.
Eduardo Sany Laber, Marco Molinaro
Added 12 May 2011
Updated 12 May 2011
Type Journal
Year 2011
Where ALGORITHMICA
Authors Eduardo Sany Laber, Marco Molinaro
Comments (0)
books