𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Covering a set by subsets

✍ Scribed by R.J. Clarke

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
310 KB
Volume
81
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

We give formulae for determining the number of ways of writing a finite set as the union of a given number of subsets, in such a way that none of the subsets may be omitted. In particular, we consider the case in which the elements of the set are identical.

πŸ“œ SIMILAR VOLUMES

On covering a product of sets with produ
On covering a product of sets with products of their subsets
✍ A.M. Odlyzko πŸ“‚ Article πŸ“… 1973 πŸ› Elsevier Science 🌐 English βš– 599 KB

+ 1 and no more than for all i. Moreover, these bounds cannot "t be improved. Identical bounds for the spanning number ' f :i no:mal product of graphs are also obtained. . Let S be a collection of subsets of a set X such that their union is X. Define c(X;S), the covering number of X wi;h rLhspect

A generalization of the weighted set cov
A generalization of the weighted set covering problem
✍ Jian Yang; Joseph Y-T. Leung πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 122 KB

## Abstract We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect __b__‐matching problem. In general,