Streaming and dynamic algorithms for minimum enclosing balls in high dimensions

Agarwal, 2004, Approximating extent measures of points, J. ACM, 51, 606, 10.1145/1008731.1008736 Agarwal, 2010, Streaming algorithms for extent problems in high dimensions, 1481 Agarwal, 2007, A space-optimal data-stream algorithm for coresets in the plane, 1 Barequet, 2001, Efficiently approximating the minimum-volume bounding box of a point set in three dimensions, J. Algorithms, 38, 91, 10.1006/jagm.2000.1127 Bentley, 1980, Decomposable searching problems I: Static-to-dynamic transformations, J. Algorithms, 1, 301, 10.1016/0196-6774(80)90015-2 Bădoiu, 2003, Smaller core-sets for balls, 801 Bădoiu, 2002, Approximate clustering via core-sets, 250 Chan, 2006, Faster core-set constructions and data stream algorithms in fixed dimensions, Comput. Geom. Theory Appl., 35, 20, 10.1016/j.comgeo.2005.10.002 Chan, 2009, Dynamic coresets, Discrete Comput. Geom., 42, 469, 10.1007/s00454-009-9165-3 Kumar, 2003, Approximating minimum enclosing balls in high dimensions using core-sets, ACM J. Exp. Algorithmics, 8, 1, 10.1145/996546.996548 Pathak, 2011 Zarrabi-Zadeh, 2008, An almost space-optimal streaming algorithm for coresets in fixed dimensions, vol. 5193, 817 Zarrabi-Zadeh, 2006, A simple streaming algorithm for minimum enclosing balls, 139