A dual algorithm for the minimum covering ball problem in ℝn

A dual algorithm for the minimum covering ball problem in ℝn

0.00 Avg rating—0 Votes
Article ID: iaor20102965
Volume: 37
Issue: 3
Start Page Number: 171
End Page Number: 175
Publication Date: May 2009
Journal: Operations Research Letters
Authors: ,
Keywords: geometry
Abstract:

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

Reviews

Required fields are marked *. Your email address will not be published.