8 search results - page 2 / 2 » On Metric Clustering to Minimize the Sum of Radii |
TALG
2010
13 years 12 days ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
JCSS
2002
13 years 5 months ago
2002
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
JPDC
2006
13 years 5 months ago
2006
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We consider the version in which communicating tasks are to...