Approximating smallest enclosing balls
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
We present two novel tailored algorithms for computing arbitrary fine approximations of the smallest enclosing ball of balls. The deterministic heuristics are based on solving relaxed decision problems using a primal-dual method.