Sciweavers

COMGEO
2010
ACM
14 years 17 days ago
Approximation algorithm for the kinetic robust K-center problem
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
Sorelle A. Friedler, David M. Mount
COMPGEOM
1993
ACM
14 years 4 months ago
Approximating Center Points with Iterated Radon Points
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
Kenneth L. Clarkson, David Eppstein, Gary L. Mille...