A dual algorithm for the minimum covering ball problem in RnRn

A dual type algorithm constructs the minimum covering ball of a given finite set of points in RnRn by finding the minimum covering balls of a sequence of subsets, each with no more than n+1n+1 points and with strictly increasing radius, until all points are covered.