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.
bregman divergence core-set minimum enclosing ball