DeepAI AI Chat
Log In Sign Up

Optimal Randomized Group Testing Algorithm to Determine the Number of Defectives

01/02/2020
by   Nader H. Bshouty, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

12/02/2017

Adaptive Group Testing Algorithms to Estimate the Number of Defectives

We study the problem of estimating the number of defective items in adap...
01/25/2021

On the binary adder channel with complete feedback, with an application to quantitative group testing

We determine the exact value of the optimal symmetric rate point in the ...
09/10/2018

Unconstraining graph-constrained group testing

In network tomography, one goal is to identify a small set of failed lin...
02/13/2020

Genetic Algorithms for Redundancy in Interaction Testing

It is imperative for testing to determine if the components within large...
09/05/2020

Optimal Deterministic Group Testing Algorithms to Estimate the Number of Defectives

We study the problem of estimating the number of defective items d withi...
02/27/2018

Follow Up on Detecting Deficiencies: An Optimal Group Testing Algorithm

In a recent volume of Mathematics Magazine (Vol. 90, No. 3, June 2017) t...
04/03/2023

Finding a Burst of Positives via Nonadaptive Semiquantitative Group Testing

Motivated by testing for pathogenic diseases we consider a new nonadapti...