Bounds for nonadaptive group tests to estimate the amount of defectives
DOI10.1007/978-3-642-17461-2_10zbMATH Open1310.68089OpenAlexW1926117152MaRDI QIDQ3066450FDOQ3066450
Authors: Peter Damaschke, Azam Sheikh Muhammad 
Publication date: 10 January 2011
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-17461-2_10
Recommendations
- Bounds for nonadaptive group tests to estimate the amount of defectives
- Randomized group testing both query-optimal and minimal adaptive
- Improved Results for Competitive Group Testing
- Optimal deterministic group testing algorithms to estimate the number of defectives
- Upper and lower bounds for competitive group testing
algorithmlower boundrandomized strategycompetitive group testinglearning 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)
Cited In (24)
- Group Testing with a Goal in Estimating the Number of Defects Under Imperfect Environmental Stress Screen Levels
- An efficient randomized group testing procedure to determine the number of defectives
- Bounds for nonadaptive group tests to estimate the amount of defectives
- Non-adaptive hypergeombtric group testing designs for identifying at most two defectives
- Optimal deterministic group testing algorithms to estimate the number of defectives
- Optimal deterministic group testing algorithms to estimate the number of defectives
- Noisy Non-Adaptive Group Testing: A (Near-)Definite Defectives Approach
- Title not available (Why is that?)
- Randomized group testing for mutually obscuring defectives
- Improved lower bound for estimating the number of defective items
- Competitive group testing and learning hidden vertex covers with minimum adaptivity
- Efficient group testing algorithms with a constrained number of positive responses
- Exact learning from an honest teacher that answers membership queries
- Bounds for the number of tests in non-adaptive randomized algorithms for group testing
- Adaptive group testing algorithms to estimate the number of defectives
- Competitive group testing
- 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
- Title not available (Why is that?)
- 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
- Density-based group testing
- 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 Q3066450)
