Sharper bounds in adpative group testing

DOI10.11650/TWJM/1500407300MaRDI QIDQ5928416zbMATH OpenOpenAlexFDO

Authors Laura Riccio, Charles J. Colbourn

Publication date 19 July 2001

Published in Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.11650/twjm/1500407300

zbMATH Keywords

adaptive group testingindividual testingminimax algorithm

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Applications of statistics to biology and medical sciences; meta analysis (62P10) Applications of statistics in engineering and industry; control charts (62P30) Applications of statistics (62P99) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• When is individual testing optimal for nonadaptive group testing?
• Individual Testing of Independent Items in Optimal Group Testing
• Adaptive group testing algorithms to estimate the number of defectives
• An efficient algorithm for combinatorial group testing
• Bounds for nonadaptive group tests to estimate the amount of defectives

Cited in

(8)

• Sets pooling designs
• Adaptive group testing for consecutive positives
• Upper and lower bounds for competitive group testing
• When is individual testing optimal for nonadaptive group testing?
• Individual Testing of Independent Items in Optimal Group Testing
• An efficient algorithm for combinatorial group testing
• Optimal non-adaptive probabilistic group testing in general sparsity regimes
• Comments on ``Nonadaptive group testing based on sparse pooling graphs

This page was built for publication: Sharper bounds in adpative group testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5928416)