On approximating the smallest enclosing Bregman balls

We present a generalization of Bădoiu and Clarkson’s algorithm [3] for computing a (1 + ɛ)-approximation of the smallest enclosing ball of a point set equipped with a Bregman divergence as a distortion measure. Categories and Subject Descriptor