An extension of Stein-Lovasz theorem and some of its applications
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
18 | en_US |
dc.citation.issue |
1 | en_US |
dc.citation.spage |
1 | en_US |
dc.citation.volume |
25 | en_US |
dc.citation.woscount |
1 | |
dc.contributor.author |
Lee, Guang-Siang | en_US |
dc.contributor.department |
應用數學系 | zh_TW |
dc.contributor.department |
Department of Applied Mathematics | en_US |
dc.date.accessioned |
2014-12-08T15:29:14Z | |
dc.date.available |
2014-12-08T15:29:14Z | |
dc.date.issued |
2013-01-01 | en_US |
dc.description.abstract |
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. | en_US |
dc.identifier.doi |
10.1007/s10878-011-9413-3 | en_US |
dc.identifier.issn |
1382-6905 | en_US |
dc.identifier.journal |
JOURNAL OF COMBINATORIAL OPTIMIZATION | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1007/s10878-011-9413-3 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/21077 | |
dc.identifier.wosnumber |
WOS:000314061400001 | |
dc.language.iso |
en_US | en_US |
dc.subject |
Stein-Lovasz theorem | en_US |
dc.subject |
Disjunct matrices | en_US |
dc.subject |
Selectors | en_US |
dc.title |
An extension of Stein-Lovasz theorem and some of its applications | en_US |
dc.type |
Article | en_US |
檔案
- 000314061400001.pdf (530.0 KB, Adobe PDF)
所屬典藏: 期刊論文