Optimal deterministic group testing algorithms to estimate the number of defectives

DOI10.1007/978-3-030-64843-5_27OpenAlexW3116368265MaRDI QIDQ5925666

Catherine A. Haddad-Zaknoon, Nader H. Bshouty

Publication date: 21 March 2023

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-64843-5_27

zbMATH Keywords

group testingpooling designdeterministic group testing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient FPRAS type group testing procedure to approximate the number of defectives
• 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
• Nonrandom binary superimposed codes

This page was built for publication: Optimal deterministic group testing algorithms to estimate the number of defectives