Approximation Strategies for Generalized Binary Search in Weighted Trees

Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski +1

We consider the following generalization of the binary search problem. A search strategy is required to locate an unknown target node $t$ in a given tree $T$. Upon querying a node…