@InProceedings{h.bshouty_et_al:LIPIcs.ISAAC.2018.34,
author = {H. Bshouty, Nader and Makhoul, Waseem},
title = {{On Polynomial Time Constructions of Minimum Height Decision Tree}},
booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)},
pages = {34:1--34:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-094-1},
ISSN = {1868-8969},
year = {2018},
volume = {123},
editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.34},
URN = {urn:nbn:de:0030-drops-99824},
doi = {10.4230/LIPIcs.ISAAC.2018.34},
annote = {Keywords: Decision Tree, Minimal Depth, Approximation algorithms}
}