Approximating min-sum k-clustering in metric spaces

@inproceedings{Bartal2001ApproximatingMK,
  title={Approximating min-sum k-clustering in metric spaces},
  author={Yair Bartal and Moses Charikar and Danny Raz},
  booktitle={STOC},
  year={2001}
}
The min-sum k-clustering problem in a metric space is to find a partition of the space into k clusters as to minimize the total sum of distances between pairs of points assigned to the same cluster. We give the first polynomial time non-trivial approximation algorithm for this problem. The algorithm provides an $\ratio$ approximation to the min-sum k-clustering problem in general metric spaces, with running time $\runtime$. The result is based on embedding of metric spaces into hierarchically… CONTINUE READING