Strict group testing and the set basis problem
From MaRDI portal
Publication:2452424
DOI10.1016/j.jcta.2014.04.005zbMath1407.05090OpenAlexW2003071155MaRDI QIDQ2452424
Azam Sheikh Muhammad, Gábor Wiener, Peter Damaschke
Publication date: 3 June 2014
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2014.04.005
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Hypergraphs (05C65) Statistical block designs (62K10) Coloring of graphs and hypergraphs (05C15) Randomized algorithms (68W20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two new perspectives on multi-stage group testing
- Bounds on the length of disjunctive codes
- Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
- Exploring the missing link among \(d\)-separable, \(\overline d\)-separable and \(d\)-disjunct matrices
- A set coverage problem
- Families of finite sets in which no set is covered by the union of two others
- On the cut-off point for combinatorial group testing
- Simplified searching for two defects
- Some optimum non-adaptive hypergeometric group testing designs for identifying two defectives
- Optimal pooling designs with error detection
- Bounds on the rate of disjunctive codes
- Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs
- Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis
- On biclique coverings
- When is Individual Testing Optimal for Nonadaptive Group Testing?
- Combinatorial Group Testing for Corruption Localizing Hashing
- New constructions of superimposed codes
- Communication Complexity
- Group Testing With Random Pools: Optimal Two-Stage Algorithms
- Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem
- Optimal Two-Stage Algorithms for Group Testing Problems
- Nonrandom binary superimposed codes
- Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes
- Minimal completely separating systems
