License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SWAT.2020.18
URN: urn:nbn:de:0030-drops-122658
URL: https://drops.dagstuhl.de/opus/volltexte/2020/12265/
Go to the corresponding LIPIcs Volume Portal


Bshouty, Nader H. ; Haddad-Zaknoon, Catherine A. ; Boulos, Raghd ; Moalem, Foad ; Nada, Jalal ; Noufi, Elias ; Zaknoon, Yara

Optimal Randomized Group Testing Algorithm to Determine the Number of Defectives

pdf-format:
LIPIcs-SWAT-2020-18.pdf (0.5 MB)


Abstract

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.

BibTeX - Entry

@InProceedings{bshouty_et_al:LIPIcs:2020:12265,
  author =	{Nader H. Bshouty and Catherine A. Haddad-Zaknoon and Raghd Boulos and Foad Moalem and Jalal Nada and Elias Noufi and Yara Zaknoon},
  title =	{{Optimal Randomized Group Testing Algorithm to Determine the Number of Defectives}},
  booktitle =	{17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)},
  pages =	{18:1--18:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-150-4},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{162},
  editor =	{Susanne Albers},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/12265},
  URN =		{urn:nbn:de:0030-drops-122658},
  doi =		{10.4230/LIPIcs.SWAT.2020.18},
  annote =	{Keywords: Group Testing, Randomized Algorithm}
}

Keywords: Group Testing, Randomized Algorithm
Collection: 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)
Issue Date: 2020
Date of publication: 12.06.2020


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI