An extension of Stein-Lovász theorem and some of its applications
From MaRDI portal
Publication:1945692
DOI10.1007/s10878-011-9413-3zbMath1268.90064OpenAlexW1982948733MaRDI QIDQ1945692
Publication date: 8 April 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-011-9413-3
Related Items (2)
The Online Storage Strategy for Automated Storage and Retrieval System with Single Open in One Dimension ⋮ Flow past two square cylinders with flexible splitter plates
Cites Work
- An upper bound of the number of tests in pooling designs for the error-tolerant complex model
- On the ratio of optimal integral and fractional covers
- \(d\)-disjunct matrices: Bounds and Lovász local lemma
- Two combinatorial covering theorems
- New combinatorial structures with applications to efficient group testing with inhibitors
- On greedy algorithms in coding theory
- Optimal Two-Stage Algorithms for Group Testing Problems
- Width Sequences for Special Classes of (0, 1)-Matrices
This page was built for publication: An extension of Stein-Lovász theorem and some of its applications
