๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A dual algorithm for the minimum covering weighted ball problem in({mathbb{R}^n})

โœ Scribed by P. M. Dearing, Andrea M. Smith

Book ID
120703779
Publisher
Springer US
Year
2011
Tongue
English
Weight
515 KB
Volume
55
Category
Article
ISSN
0925-5001

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A dual algorithm for the minimum coverin
A dual algorithm for the minimum covering ball problem in
โœ P.M. Dearing; Christiane R. Zeck ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 953 KB

A dual type algorithm constructs the minimum covering ball of a given finite set of points in R 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.