Note on generalized group testing

11/08/2022
by   Ilya Vorobyev, et al.
0

In this note, we present a new adaptive algorithm for generalized group testing, which is asymptotically optimal if d=o(log_2|E|), E is a set of potentially contaminated sets, d is a maximal size of elements of E. Also, we design a 3-stage algorithm, which is asymptotically optimal for d=2.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/22/2020

Optimal Multistage Group Testing Algorithm for 3 Defectives

Group testing is a well-known search problem that consists in detecting ...
research
08/09/2018

A note on optimal design for hierarchical generalized group testing

Choosing an optimal strategy for hierarchical group testing is an import...
research
02/10/2022

Group Testing on General Set-Systems

Group testing is one of the fundamental problems in coding theory and co...
research
02/22/2023

A Note on "Towards Efficient Data Valuation Based on the Shapley Value”

The Shapley value (SV) has emerged as a promising method for data valuat...
research
06/29/2021

On the Optimal Configuration of a Square Array Group Testing Algorithm

Up to date, only lower and upper bounds for the optimal configuration of...
research
11/18/2020

Engineering a Fast Probabilistic Isomorphism Test

We engineer a new probabilistic Monte-Carlo algorithm for isomorphism te...
research
07/21/2022

On the Optimal Pairwise Group Testing Algorithm

Originally suggested for the blood testing problem by Dorfman in 1943, a...

Please sign up or login with your details

Forgot password? Click here to reset