A Constant Approximation for Min-sum k-ClusteringResearch Paper
Clustering a finite metric space into groups is a basic primitive of data analysis and operations research. Among the -clustering objectives, min-sum -clustering charges every cluster the sum of the pairwise distances inside it. Unlike -median or -means it uses no centers, so it is the natural objective when only pairwise dissimilarities are available…