Optimal Randomized Group Testing Algorithm to Determine the Number of Defectives

Optimal Randomized Group Testing Algorithm to Determine the Number of Defectives

We study the problem of determining exactly the 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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2020-01
Hauptverfasser: Bshouty, Nader H, Haddad-Zaknoon, Catherine A, Boulos, Raghd, Moalem, Foad, Jalal Nada, Noufi, Elias, Zaknoon, Yara
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Lower bounds
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We study the problem of determining exactly the 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.
ISSN:2331-8422