2026-07-26T05:18:17Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:12265 2024-03-06T10:49:29Z ddc:004 open_access

Optimal Randomized Group Testing Algorithm to Determine the Number of Defectives Bshouty, Nader H. Haddad-Zaknoon, Catherine A. Boulos, Raghd Moalem, Foad Nada, Jalal Noufi, Elias Zaknoon, Yara Group Testing Randomized Algorithm We study the problem of determining the exact number of defective items in an adaptive group testing by using a minimum number of tests. We improve the existing algorithm and prove a lower bound that shows that the number of tests in our algorithm is optimal up to small additive terms. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Nader H. Bshouty and Catherine A. Haddad-Zaknoon and Raghd Boulos and Foad Moalem and Jalal Nada and Elias Noufi and Yara Zaknoon 2020 Is Part Of LIPIcs, Volume 162, 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SWAT.2020.18 urn:nbn:de:0030-drops-122658 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2020.18 eng https://creativecommons.org/licenses/by/3.0/legalcode