An efficient FPRAS type group testing procedure to approximate the number of defectives

DOI10.1007/s10878-012-9516-5zbMath1311.90117MaRDI QIDQ2444143

Yongxi Cheng, Yin-Feng Xu

Publication date: 8 April 2014

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9516-5

zbMATH Keywords

fault detectionrandomized algorithmgroup testingFPRAS

Mathematics Subject Classification ID

90C27: Combinatorial optimization

Related Items

Optimal deterministic group testing algorithms to estimate the number of defectives, Optimal deterministic group testing algorithms to estimate the number of defectives, A randomized competitive group testing procedure, A new randomized algorithm for group testing with unknown number of defective items

Cites Work

• Unnamed Item
• An efficient randomized group testing procedure to determine the number of defectives
• The space complexity of approximating the frequency moments
• COMPETITIVE GROUP TESTING AND LEARNING HIDDEN VERTEX COVERS WITH MINIMUM ADAPTIVITY
• Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives
• A Sequential Method for Screening Experimental Variables
• Born again group testing: Multiaccess communications
• Probability Inequalities for Sums of Bounded Random Variables
• Pooled Testing for HIV Screening: Capturing the Dilution Effect