Generalized clustering
Sudipto Guha, Kamesh Munagala · 2002
In generalized k-clustering, we are given n points in a metric space with distance function d. The goal is to partition the points into k clusters, C 1;C 2;:::;Ck so that for a given, the following objective function is minimized: kX 1 jClj l=1