On the hardness of the minimum height decision tree problem
type: Item
instance of: scholarly article
title: On the hardness of the minimum height decision tree problem
zbMATH Open document ID: 1078.68043
author: Eduardo S. Laber
author: Loana T. Nogueira
published in: Discrete Applied Mathematics
publication date: 2004-11-12T00:00:00Z
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 2115234
zbMATH Keywords: Algorithmical approximation
zbMATH Keywords: Computational complexity
zbMATH Keywords: Decision trees
MaRDI profile type: Publication
full work available at URL: j.dam.2004.06.002
OpenAlex ID: W2008789644
cites work: Decision Trees for Geometric Models
cites work: Q4527016
cites work: A threshold of ln n for approximating set cover
cites work: Optimal Binary Identification Procedures
cites work: Constructing optimal binary decision trees is NP-complete
cites work: Q4142699
DOI: 10.1016/J.DAM.2004.06.002
description: scientific article; zbMATH DE number 2115234