𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A dual algorithm for the minimum covering ball problem in

✍ Scribed by P.M. Dearing; Christiane R. Zeck

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
953 KB
Volume
37
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

Algorithms for the minimum partitioning
Algorithms for the minimum partitioning problems in graphs
✍ Hiroshi Nagamochi πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 545 KB

## Abstract In this paper, the author explains the recent evolution of algorithms for minimum partitioning problems in graphs. When the set of vertices of a graph having non‐negative weights for edges is divided into __k__ subsets, the set of edges for which both endpoints are contained in differen