An extension of Stein-Lovasz theorem and some of its applications

檔案

日期

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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Lee, G.-S. (2013). An extension of Stein-Lovasz theorem and some of its applications. JOURNAL OF COMBINATORIAL OPTIMIZATION, 25(1), 1–18. https://doi.org/10.1007/s10878-011-9413-3

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/21077