Efficient Group Testing Algorithms with a Constrained Number of Positive Responses

DOI10.1007/978-3-319-12691-3_37zbMATH Open1335.68242OpenAlexW256251597MaRDI QIDQ2942424

Annalisa De Bonis

Publication date: 11 September 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-319-12691-3_37

Mathematics Subject Classification ID

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

Related Items (6)

Adaptive group testing with a constrained number of positive responses improved ⋮ Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing ⋮ Performance of Group Testing Algorithms With Near-Constant Tests Per Item ⋮ Efficient testing of groups ⋮ On optimal randomized group testing with one defective item and a constrained number of positive responses ⋮ A class of asymptotically optimal group screening strategies with limited item participation

This page was built for publication: Efficient Group Testing Algorithms with a Constrained Number of Positive Responses

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