Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes

DOI10.1137/050631847zbMath1124.68043OpenAlexW3097993501MaRDI QIDQ5422490

David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg

Publication date: 22 October 2007

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/050631847

zbMATH Keywords

Bloom filtersChinese remainderingCombinatorial group testing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Reliability, availability, maintenance, inspection in operations research (90B25) Combinatorial optimization (90C27)

Related Items (17)

Randomized Group Testing Both Query-Optimal and Minimal Adaptive ⋮ BOUNDS FOR NONADAPTIVE GROUP TESTS TO ESTIMATE THE AMOUNT OF DEFECTIVES ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Structure-aware combinatorial group testing: a new method for pandemic screening ⋮ Synthetic sequence design for signal location search ⋮ Two new perspectives on multi-stage group testing ⋮ Non-adaptive complex group testing with multiple positive sets ⋮ Combinatorial search in two and more rounds ⋮ Group testing aggregate signatures with soundness ⋮ Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis ⋮ Strict group testing and the set basis problem ⋮ A new strongly competitive group testing algorithm with small sequentiality ⋮ Non-adaptive Complex Group Testing with Multiple Positive Sets ⋮ From discrepancy to majority ⋮ COMPETITIVE GROUP TESTING AND LEARNING HIDDEN VERTEX COVERS WITH MINIMUM ADAPTIVITY ⋮ Low-weight superimposed codes and related combinatorial structures: bounds and applications ⋮ On Efficient Gossiping in Radio Networks

This page was built for publication: Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes