Pith. sign in

REVIEW

Group design in group testing for COVID-19 : A French case-study

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2011.06927 v1 pith:54OBF4JQ submitted 2020-11-13 stat.ME math.OC

Group design in group testing for COVID-19 : A French case-study

classification stat.ME math.OC
keywords groupdesignproblemgroupstestingcovid-19expectedfalse
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Group testing is a screening strategy that involves dividing a population into several disjointed groups of subjects. In its simplest implementation, each group is tested with a single test in the first phase, while in the second phase only subjects in positive groups, if any, need to be tested again individually. In this paper, we address the problem of group testing design, which aims to determine a partition into groups of a finite population in such a way that cardinality constraints on the size of each group and a constraint on the expected total number of tests are satisfied while minimizing a linear combination of the expected number of false negative and false positive classifications. First, we show that the properties and model introduced by Aprahmian et al. can be extended to the group test design problem, which is then modeled as a constrained shortest path problem on a specific graph. We design and implement an ad hoc algorithm to solve this problem. On instances based on Sant\'e Publique France data on Covid-19 screening tests, the results of the computational experiments are very promising.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.