Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously

Matthias Kaul, Kelin Luo, Matthias Mnich +1

We study the problem of partitioning a set of $n$ objects in a metric space into $k$ clusters $V_1,\dots ,V_k$. The quality of the clustering is measured by considering the vector o…