Bounds for nonadaptive group tests to estimate the amount of defectives
DOI10.1142/S1793830911001383zbMATH Open1252.68138MaRDI QIDQ2905282FDOQ2905282
Authors: Peter Damaschke, Azam Sheikh Muhammad 
Publication date: 27 August 2012
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Recommendations
- Bounds for nonadaptive group tests to estimate the amount of defectives
- Randomized group testing both query-optimal and minimal adaptive
- Optimal deterministic group testing algorithms to estimate the number of defectives
- Two new perspectives on multi-stage group testing
- Adaptive group testing algorithms to estimate the number of defectives
randomizationlower boundcompetitive ratiogroup testingcombinatorial searchlinear programlearning by queriesnonadaptive strategy
Computational learning theory (68Q32) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Randomized algorithms (68W20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
- Optimal Two-Stage Algorithms for Group Testing Problems
- Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis
- Improved Results for Competitive Group Testing
- Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes
- Competitive group testing and learning hidden vertex covers with minimum adaptivity
- Exploring the missing link among \(d\)-separable, \(\overline d\)-separable and \(d\)-disjunct matrices
Cited In (29)
- A new randomized algorithm for group testing with unknown number of defective items
- Group Testing with a Goal in Estimating the Number of Defects Under Imperfect Environmental Stress Screen Levels
- Non-adaptive hypergeombtric group testing designs for identifying at most two defectives
- Optimal deterministic group testing algorithms to estimate the number of defectives
- Noisy Non-Adaptive Group Testing: A (Near-)Definite Defectives Approach
- A toolbox for provably optimal multistage strict group testing strategies
- Title not available (Why is that?)
- Title not available (Why is that?)
- Randomized group testing for mutually obscuring defectives
- Quaternary splitting algorithm in group testing
- Sharper bounds in adpative group testing
- Competitive group testing and learning hidden vertex covers with minimum adaptivity
- Efficient group testing algorithms with a constrained number of positive responses
- Bounds for the number of tests in non-adaptive randomized algorithms for group testing
- Adaptive group testing algorithms to estimate the number of defectives
- Estimation of the Proportion of Defective Units by Using Group Testing Under the Existence of a Threshold of Detection
- An efficient FPRAS type group testing procedure to approximate the number of defectives
- Learning a hidden graph
- A Fundamental Monotonicity in Group Testing
- Bounds for nonadaptive group tests to estimate the amount of defectives
- Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing
- Two new perspectives on multi-stage group testing
- Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
- Identifying defective sets using queries of small size
- Density-based group testing
- Group testing, the pooled hypergeometric distribution, and estimating the number of defectives in small populations
- Determining defectives in a linear order
- Title not available (Why is that?)
- Randomized group testing both query-optimal and minimal adaptive
This page was built for publication: Bounds for nonadaptive group tests to estimate the amount of defectives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2905282)
