29 search results - page 1 / 6 » On clustering to minimize the sum of radii |
100
click to vote
ALGORITHMICA
2010
15 years 1 months ago
2010
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 r...
SODA
2008
ACM
15 years 3 months ago
2008
ACM
103
Voted
EOR
2010
15 years 1 months ago
2010
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
CCCG
2007
15 years 3 months ago
2007
Given a disk O in the plane called the objective, we want to find n small disks P1, . . . , Pn called the pupils such that n i,j=1 Pi Pj ⊇ O, where denotes the Minkowski diffe...
161
Voted
SDM
2004
SIAM
15 years 3 months ago
2004
SIAM
Microarray experiments have been extensively used for simultaneously measuring DNA expression levels of thousands of genes in genome research. A key step in the analysis of gene e...