Paper Info
Title
A Simple Streaming Algorithm for Minimum Enclosing Balls
Abstract
We analyze an extremely simple approximation algo- rithm 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 approx- imation in any dimension using minimum space in just one pass over the data points.
Year
Venue
Keywords
2006
CCCG
streaming algorithm
Field
DocType
Citations 
Data point,Approximation algorithm,Discrete mathematics,Combinatorics,Streaming algorithm,Computer science,Ball (bearing)
Conference
16
PageRank 
References 
Authors
0.78
10
2
Name
Order
Citations
PageRank
Hamid Zarrabi-Zadeh111113.63
Timothy M. Chan22033150.55