… We consider the problem of constructing decision trees for entity identification from a given …
of entities over a fixed set of attributes and a probability distribution over the set of entities that …

… We consider the problem of constructing decision trees for entity identification from a given …
of entities over a fixed set of attributes and a probability distribution over the set of entities that …

… We consider the problem of constructing decision trees for entity identification from a given …
of entities over a fixed set of attributes and a probability distribution over the set of entities that …

… approximation algorithms and inapproximability results for these four types of problems
separately. The cost of a decision tree … Adler and Heeringa present an (ln n+1) approximation for …

… for this class since we show an Ω(log n) hardness of approximation. Thus, we consider the
… Approximation algorithms for optimal decision trees and adaptive TSP problems. In: ICALP (…

… -time approximation algorithm for MCI with an approximation ratio … , we present results of
hardness of approximation for this … The algorithm is adapted from [20] for entity identification and …

… of constructing decision trees for entity identification from a … present an improved
approximation algorithm for the above … It is interesting to note that the hardness results in [9] are …

… a decision tree that outputs the correct class of a given input object. Each internal tree
node … algorithms and hardness results. In: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-…

… for the adaptive traveling salesman problem is in Section 5; Appendix A contains a nearly
matching hardness of approximation result. Finally, Section 6 is on the adaptive traveling …

… n, we say that algorithm A is a polynomial ρ ( n ) -approximation algorithm if for all instances
x … correctly identify each entity, and we require that a path from the root of the decision tree to …