On approximating the smallest enclosing Bregman Balls
説明
We present a generalization of Bǎdoiu and Clarkson's algorithm [3] for computing a (1+e)-approximation of the smallest enclosing ball of a point set equipped with a Bregman divergence as a distortion measure.
収録刊行物
-
- Proceedings of the twenty-second annual symposium on Computational geometry
-
Proceedings of the twenty-second annual symposium on Computational geometry 485-486, 2006-06-05
ACM