When is individual testing optimal for nonadaptive group testing?
From MaRDI portal
Given a set of \(n\) items with \(d\) defectives, identify the \(d\) defectives with the minimum number of tests each of which tells whether a particular subset of items contains a defective item or not. This problem is called combinatorial group testing. When all tests are given at the same time, it is called the nonadaptive group testing. In this paper, the authors present some sufficient conditions for nonadaptive group testing to have individual testing as its optimal solution.
Recommendations
Cited in
(18)- A simple characterization of non-randomized admissible procedures in group testing
- Some optimum non-adaptive hypergeometric group testing designs for identifying two defectives
- The optimal number of items in a group for group testing
- Identifying defective network components through restricted group testing
- Non-adaptive group testing on graphs with connectivity
- A note on the uniqueness of \((w, r)\) cover-free codes
- Strict group testing and the set basis problem
- Improved bounds for group testing designs
- Combinatorial pair testing: distinguishing workers from slackers
- Individual Testing of Independent Items in Optimal Group Testing
- scientific article; zbMATH DE number 4043100 (Why is no real title available?)
- Two new perspectives on multi-stage group testing
- scientific article; zbMATH DE number 874562 (Why is no real title available?)
- Optimal non-adaptive probabilistic group testing in general sparsity regimes
- Algorithms and Data Structures
- Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes
- Optimal group testing
- Sharper bounds in adpative group testing
This page was built for publication: When is individual testing optimal for nonadaptive group testing?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2753543)