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.

• Type: Conference
• Year: 2006
• Where: CCCG
• Authors: Hamid Zarrabi-Zadeh, Timothy M. Chan
• Keywords: Approximation, CCCG 2006, CCCG 2007, Minimum Enclosing Ball, Simple Approximation Algorithm