| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142835 | Operations Research Letters | 2009 | 5 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
P.M. Dearing, Christiane R. Zeck,