Approximation Algorithms for Decision Trees

  • Aline Saettler
  • Eduardo S. Laber


Decision trees are a central structure in computer science, having applications in many areas. This thesis contributes to the understanding of this important structure by proving by proving theoretical bounds on its behavior and also providing algorithms to construct decision trees with much stronger guarantee and that can cope with more general situations than the solutions available in the literature.

Como Citar

Selecione um Formato
SAETTLER, Aline; LABER, Eduardo S.. Approximation Algorithms for Decision Trees. In: CONCURSO DE TESES E DISSERTAÇÕES (CTD), 31. , 2018, Natal. Anais [...]. Porto Alegre: Sociedade Brasileira de Computação, 2018 . ISSN 2763-8820. DOI: