A new randomized algorithm for group testing with unknown number of defective items
From MaRDI portal
Publication:2352359
DOI10.1007/s10878-013-9640-xzbMath1326.90070OpenAlexW1991463615MaRDI QIDQ2352359
Ju'e Guo, Feifeng Zheng, Yongxi Cheng
Publication date: 1 July 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-013-9640-x
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (1)
Cites Work
- Unnamed Item
- An efficient randomized group testing procedure to determine the number of defectives
- Competitive group testing
- A new hyperelastic model for transversely isotropic solids
- Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis
- An efficient FPRAS type group testing procedure to approximate the number of defectives
- Randomized Group Testing Both Query-Optimal and Minimal Adaptive
- BOUNDS FOR NONADAPTIVE GROUP TESTS TO ESTIMATE THE AMOUNT OF DEFECTIVES
- COMPETITIVE GROUP TESTING AND LEARNING HIDDEN VERTEX COVERS WITH MINIMUM ADAPTIVITY
- A Sequential Method for Screening Experimental Variables
- Born again group testing: Multiaccess communications
- Modifications of Competitive Group Testing
- Improved Results for Competitive Group Testing
- Nonrandom binary superimposed codes
- A Method for Detecting All Defective Members in a Population by Group Testing
- Pooled Testing for HIV Screening: Capturing the Dilution Effect
This page was built for publication: A new randomized algorithm for group testing with unknown number of defective items
