Given n circle centers, compute the convex hull of the circles (which can be done in O(n log n)). Since the convex hull is necessarily a convex polygon, you can apply Welzl’s algorithm to its vertices.