On Greedy Algorithms for Decision Trees

  title={On Greedy Algorithms for Decision Trees},
  author={Ferdinando Cicalese and Tobias Jacobs and Eduardo Sany Laber and Marco Molinaro},
In the general search problem we want to identify a specific element using a set of allowed tests. The general goal is to minimize the number of tests performed, although different measures are used to capture this goal. In this work we introduce a novel greedy approach that achieves the best known approximation ratios simultaneously for many different variations of this identification problem. In addition to this flexibility, our algorithm admits much shorter and simpler analyses than previous… CONTINUE READING