✦ LIBER ✦

Large sets of coverings

✍ Scribed by Tuvi Etzion

Publisher: John Wiley and Sons
Year: 1994
Tongue: English
Weight: 699 KB
Volume: 2
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.3180020509

No coin nor oath required. For personal study only.

✦ Synopsis

Large sets of packings were investigated extensively. Much less is known about the dual problem, Le., large sets of coverings. We examine two types of important questions in this context; what is the maximum number of disjoint optimal coverings? and what is the minimum number of optimal coverings for which the union covers the space? We give various constructions which give the optimal solutions and some good upper and lower bounds on both questions, respectively. 0 1994 John Wiley & Sons, Inc.

1 ( : ) / M I and M is the size of an optimal (n, k, t ) packing.

📜 SIMILAR VOLUMES

Existence of large sets of coverings wit

Existence of large sets of coverings with block size 3

✍ L. Ji 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB 👁 1 views

## Abstract Two types of large sets of coverings were introduced by T. Etzion (J Combin Designs, 2(1994), 359–374). What is maximum number (denoted by λ(__n,k__)) of disjoint optimal (__n,k,k__ − 1) coverings? What is the minimum number (denoted by µ(__n,k__)) of disjoint optimal (__n,k,k__ − 1) co

New coverings of t-sets with (t + 1)-set

New coverings of t-sets with (t + 1)-sets

✍ Kari J. Nurmela; Patric R. J. Östergård 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 434 KB 👁 1 views

The minimum number of k-subsets out of a v-set such that each t-set is contained in at least one k-set is denoted by C(v, k, t). In this article, a computer search for finding good such covering designs, leading to new upper bounds on C(v, k, t), is considered. The search is facilitated by predeterm

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.

An efficient heuristic for large set cov

An efficient heuristic for large set covering problems

✍ Francis J. Vasko 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 477 KB

## Abstract A heuristic solution procedure for set covering is presented that works well for large, relatively dense problems. In addition, a confidence interval is established about the unknown global optimum. Results are presented for 30 large randomly generated problems.

Large Finite Sets

✍ Herman Ruge Jervell 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 271 KB

Note: A local-search heuristic for large

Note: A local-search heuristic for large set-covering problems

✍ Larry W. Jacobs; Michael J. Brusco 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 751 KB