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

Full work available at URL https://doi.org/10.1137/1.9781611977073.103

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(2)

• Impossibility of depth reduction in explainable clustering
• Sublinear data structures for nearest neighbor in ultra high dimensions

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)