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.
β¦ LIBER β¦
Entropy and set covering
β Scribed by L.P. Lefkovitch
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 755 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0020-0255
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Covering a set by subsets
β
R.J. Clarke
π
Article
π
1990
π
Elsevier Science
π
English
β 310 KB
Probabilistic partial set covering probl
β
Hanif D. Sherali; Seong-In Kim; Edna L. Parrish
π
Article
π
1991
π
John Wiley and Sons
π
English
β 563 KB
Approximate Set Covering in Uniform Hype
β
Michael Krivelevich
π
Article
π
1997
π
Elsevier Science
π
English
β 296 KB
The weighted set covering problem, restricted to the class of r-uniform hypergraphs, is considered. We propose a new approach, based on a recent result of Aharoni, Holzman, and Krivelevich about the ratio of integer and fractional covering numbers in k-colorable r-uniform hypergraphs. This approach,
Entropies in finite fuzzy sets
β
E. Trillas; T. Riera
π
Article
π
1978
π
Elsevier Science
π
English
β 574 KB
Bernstein sets and ΞΊ -coverings
β
Jan Kraszewski; Robert RaΕowski; PrzemysΕaw Szczepaniak; Szymon Ε»eberski
π
Article
π
2010
π
John Wiley and Sons
π
English
β 145 KB
In this paper we study a notion of a ΞΊ-covering set in connection with Bernstein sets and other types of nonmeasurability. Our results correspond to those obtained by Muthuvel in [7] and Nowik in [8]. We consider also other types of coverings.
A lagrangian heuristic for set-covering
β
J. E. Beasley
π
Article
π
1990
π
John Wiley and Sons
π
English
β 662 KB