Optimal Two-Stage Algorithms for Group Testing Problems
From MaRDI portal
Publication:5317194
DOI10.1137/S0097539703428002zbMath1079.68043OpenAlexW2054082149MaRDI QIDQ5317194
Annalisa De Bonis, Ugo Vaccaro, Leszek Gąsieniec
Publication date: 16 September 2005
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539703428002
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Combinatorics in computer science (68R05) Extremal set theory (05D05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (35)
Distributed bare-bones communication in wireless networks ⋮ A Note on the Minimax Solution for the Two-Stage Group Testing Problem ⋮ 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 ⋮ The identification of positive clones in a general inhibitor model ⋮ Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing ⋮ Exact learning of juntas from membership queries ⋮ Two new perspectives on multi-stage group testing ⋮ Efficiently correcting matrix products ⋮ Efficiently Correcting Matrix Products ⋮ $$\epsilon $$-Almost Selectors and Their Applications ⋮ Combinatorial search in two and more rounds ⋮ On the complexity of neighbourhood learning in radio networks ⋮ A survey on nonadaptive group testing algorithms through the angle of decoding ⋮ New combinatorial structures with applications to efficient group testing with inhibitors ⋮ An extension of Stein-Lovász theorem and some of its applications ⋮ Smart elements in combinatorial group testing problems with more defectives ⋮ Strict group testing and the set basis problem ⋮ A new strongly competitive group testing algorithm with small sequentiality ⋮ Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications ⋮ Group Testing with Multiple Mutually-Obscuring Positives ⋮ A new kind of selectors and their applications to conflict resolution in wireless multichannels networks ⋮ Subquadratic non-adaptive threshold group testing ⋮ Partial covering arrays: algorithms and asymptotics ⋮ Deterministic M2M multicast in radio networks ⋮ COMPETITIVE GROUP TESTING AND LEARNING HIDDEN VERTEX COVERS WITH MINIMUM ADAPTIVITY ⋮ Token traversal in ad hoc wireless networks via implicit carrier sensing ⋮ Low-weight superimposed codes and related combinatorial structures: bounds and applications ⋮ Optimal channel utilization with limited feedback ⋮ Rounds in a combinatorial search problem ⋮ On Efficient Gossiping in Radio Networks ⋮ Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel ⋮ New selectors and locally thin families with applications to multi-access channels supporting simultaneous transmissions ⋮ Unnamed Item
This page was built for publication: Optimal Two-Stage Algorithms for Group Testing Problems
