On Metric Clustering to Minimize the Sum of Radii

13 years 4 months ago

Download www.uwosh.edu

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

Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. P

Real-time Traffic

ALGORITHMICA 2010 | Constant Doubling Dimension | Minimum Interpoint Distances | Randomized Algorithm |

claim paper

» Small Space Representations for Metric MinSum k Clustering and Their Applications

» Min sum clustering with penalties

» Clustering for metric and nonmetric distance measures

» A ConstantFactor Approximation Algorithm for the kMedian Problem

» Task assignment in heterogeneous computing systems

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2010
Where	ALGORITHMICA
Authors	Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan

Comments (0)

Sciweavers

On Metric Clustering to Minimize the Sum of Radii

ALGORITHMICA 2010 | Constant Doubling Dimension | Minimum Interpoint Distances | Randomized Algorithm |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers