On Metric Clustering to Minimize the Sum of Radii

Abstract Given an n-point metric (P,d) and an integer k > 0, we consider the problem of covering P by k balls so as to minimize the sum of the radii of the balls. We present a randomized algorithm that runs in nO(logn

• Type: Journal
• Year: 2010
• Where: ALGORITHMICA
• Authors: Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan
• Keywords: ALGORITHMICA 2010, Constant Doubling Dimension, Minimum Interpoint Distances, Randomized Algorithm