A generalized minimum cost k-clustering

We consider the problems of set partitioning into <i>k</i> clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we assume that it satisfies some natural structural constraints. That is, we assume that the cost function is monotone, the cost of a singleton is zero, and we assume that for… CONTINUE READING