An extension of Stein-Lovasz theorem and some of its applications
檔案
- 000314061400001.pdf (530.0 KB, Adobe PDF)
日期
2013-01-01
類型
系所
期刊名稱
JOURNAL OF COMBINATORIAL OPTIMIZATION
卷期與頁次
第 25 卷第 1 期,頁 1–18
ISSN
1382-6905
語言
英文
摘要
The Stein-Lovasz theorem provides an algorithmic way to deal with the existence of certain good coverings, and thus offers bounds related to some combinatorial structures. An extension of the classical Stein-Lovasz theorem for multiple coverings is given, followed by some applications for finding upper bounds of the sizes of (d,s out of r;z]-disjunct matrices and (k,m,c,n;z)-selectors, respectively. This gives a unified treatment for some previously known results relating to various models of group testing.