@InProceedings{gershtein_et_al:LIPIcs.ICDT.2022.4,
author = {Gershtein, Shay and Avron, Uri and Guy, Ido and Milo, Tova and Novgorodov, Slava},
title = {{On the Hardness of Category Tree Construction}},
booktitle = {25th International Conference on Database Theory (ICDT 2022)},
pages = {4:1--4:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-223-5},
ISSN = {1868-8969},
year = {2022},
volume = {220},
editor = {Olteanu, Dan and Vortmeier, Nils},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2022.4},
URN = {urn:nbn:de:0030-drops-158785},
doi = {10.4230/LIPIcs.ICDT.2022.4},
annote = {Keywords: maximum independent set, approximation algorithms, approximation hardness bounds, taxonomy construction, category tree construction}
}