On the hardness of category tree construction

DOI10.4230/LIPICS.ICDT.2022.4MaRDI QIDQ6491013FDOQ6491013

Authors: Shay Gershtein, Uri Avron, Ido Guy, Tova Milo, Slava Novgorodov 

Publication date: 23 April 2024

zbMATH Keywords

approximation algorithmsmaximum independent settaxonomy constructionapproximation hardness boundscategory tree construction

Mathematics Subject Classification ID

Database theory (68P15)

This page was built for publication: On the hardness of category tree construction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6491013)