Sciweavers

CCCG
2006

A Simple Streaming Algorithm for Minimum Enclosing Balls

14 years 1 months ago
A Simple Streaming Algorithm for Minimum Enclosing Balls
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 algorithm computes a 3/2-factor approximation in any dimension using minimum space in just one pass over the data points.
Hamid Zarrabi-Zadeh, Timothy M. Chan
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2006
Where CCCG
Authors Hamid Zarrabi-Zadeh, Timothy M. Chan
Comments (0)