An extension of Stein-Lovász theorem and some of its applications

Guang-Siang Lee ()
Additional contact information
Guang-Siang Lee: National Chiao-Tung University

Journal of Combinatorial Optimization, 2013, vol. 25, issue 1, No 1, 18 pages

Abstract: Abstract The Stein-Lovász 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-Lovász 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.

Keywords: Stein-Lovász theorem; Disjunct matrices; Selectors (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-011-9413-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:25:y:2013:i:1:d:10.1007_s10878-011-9413-3

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-011-9413-3

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().