Almost tight approximation algorithms for explainable clustering

DOI10.1137/1.9781611977073.103MaRDI QIDQ6575178zbMATH OpenFDO

Authors H. Esfandiari, Vahab S. Mirrokni, Shyam Narayanan

Publication date 19 July 2024

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Almost tight approximation algorithms for explainable clustering

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