A class of asymptotically optimal group testing strategies to identify good items

DOI10.1016/j.dam.2019.01.040zbMath1409.68195OpenAlexW2916390161WikidataQ128336531 ScholiaQ128336531MaRDI QIDQ1741503

Yunyue Yang, Yongxi Cheng, Ding-Zhu Du

Publication date: 3 May 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.01.040

zbMATH Keywords

algorithmlower boundgroup testingincomplete identification

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Reliability, availability, maintenance, inspection in operations research (90B25) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Randomized group testing for mutually obscuring defectives
• Two new perspectives on multi-stage group testing
• Non-adaptive complex group testing with multiple positive sets
• A queueing model for general group screening policies and dynamic item arrivals
• Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
• Applications of bulk queues to group testing models with incomplete identification
• Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes
• Born again group testing: Multiaccess communications
• Threshold and Majority Group Testing
• A Method for Detecting All Defective Members in a Population by Group Testing
• Pooled Testing for HIV Screening: Capturing the Dilution Effect
• Computational Science – ICCS 2005

This page was built for publication: A class of asymptotically optimal group testing strategies to identify good items