Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

CCCG
2006

favoriteEmaildiscussreport

116views Computational Geometry» more CCCG 2006»

A Simple Streaming Algorithm for Minimum Enclosing Balls

13 years 5 months ago

A Simple Streaming Algorithm for Minimum Enclosing Balls

Download cccg.ca

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

Real-time Traffic

Approximation | CCCG 2006 | CCCG 2007 | Minimum Enclosing Ball | Simple Approximation Algorithm |

claim paper

Related Content

» Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem

» Streaming Algorithms for extent problems in high dimensions

» Smaller coresets for balls

» Simpler core vector machines with enclosing balls

» Two Algorithms for the Minimum Enclosing Ball Problem

» CorePreserving Algorithms

» Quantile approximation for robust statistical estimation

» Fast SmallestEnclosingBall Computation in High Dimensions

» Approximating Parameterized Convex Optimization Problems

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2006
Where	CCCG
Authors	Hamid Zarrabi-Zadeh, Timothy M. Chan

Comments (0)