The algorithms recently proposed in the literature
for building explainable clustering compare their costs with the
costs of optimal unrestricted clustering
[1]}, [2]}, [3]}, [4]}, [5]}, [6]}.
A major open question in this line of research is
whether better bounds can be obtained when the comparison is made against the
optimal explainable clustering.
