97 search results - page 2 / 20 » Approximate center points with proofs |
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
JCSS
2002
13 years 4 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...
COMGEO
2010
ACM
13 years 5 months ago
2010
ACM
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...
ALENEX
2004
13 years 6 months ago
2004
Given a terrain T and a point p on or above it, we wish to compute the region Rp that is visible from p. We present a generic radar-like algorithm for computing an approximation o...
CCCG
2006
13 years 6 months ago
2006
We analyze an extremely simple approximation algorithm for computing the minimum enclosing ball (or the 1-center) of a set of points in high dimensions. We prove that this algorit...