English
Related papers

Related papers: Sharp Estimates for Optimal Multistage Group Parti…

200 papers

We consider the problem of detecting a small subset of defective items from a large set via non-adaptive "random pooling" group tests. We consider both the case when the measurements are noiseless, and the case when the measurements are…

Information Theory · Computer Science 2011-07-25 Chun Lam Chan , Pak Hou Che , Sidharth Jaggi , Venkatesh Saligrama

In the context of fault-detection problems, the objective is to identify all defective items among a set of $n$ binary-state items using the minimum number of tests. The {group testing} paradigm, which allows testing a subset of items in a…

Combinatorics · Mathematics 2025-11-18 Jun Wu , Yongxi Cheng , Zhen Yang , Feng Chu , Junkai He

Multi-stage stochastic programming is a well-established framework for sequential decision making under uncertainty by seeking policies that are fully adapted to the uncertainty. Often such flexible policies are not desirable, and the…

Optimization and Control · Mathematics 2024-08-06 Beste Basciftci , Shabbir Ahmed , Nagi Gebraeel

Non-adaptive group testing refers to the problem of inferring a sparse set of defectives from a larger population using the minimum number of simultaneous pooled tests. Recent positive results for noiseless group testing have motivated the…

Information Theory · Computer Science 2021-07-16 Gabriel Arpino , Nicolò Grometto , Afonso S. Bandeira

In group testing, the goal is to identify a subset of defective items within a larger set of items based on tests whose outcomes indicate whether at least one defective item is present. This problem is relevant in areas such as medical…

Information Theory · Computer Science 2022-10-24 Eric Price , Jonathan Scarlett , Nelvin Tan

The basic goal in combinatorial group testing is to identify a set of up to $d$ defective items within a large population of size $n \gg d$ using a pooling strategy. Namely, the items can be grouped together in pools, and a single…

Discrete Mathematics · Computer Science 2013-01-21 Mahdi Cheraghchi

We consider the group testing problem, in the case where the items are defective independently but with non-constant probability. We introduce and analyse an algorithm to solve this problem by grouping items together appropriately. We give…

Information Theory · Computer Science 2015-02-04 Tom Kealy , Oliver Johnson , Robert Piechocki

The task of non-adaptive group testing is to identify up to $d$ defective items from $N$ items, where a test is positive if it contains at least one defective item, and negative otherwise. If there are $t$ tests, they can be represented as…

Information Theory · Computer Science 2020-01-07 Thach V. Bui , Minoru Kuribayashi , Tetsuya Kojima , Roghayyeh Haghvirdinezhad , Isao Echizen

The group testing problem concerns discovering a small number of defective items within a large population by performing tests on pools of items. A test is positive if the pool contains at least one defective, and negative if it contains no…

Information Theory · Computer Science 2026-05-15 Matthew Aldridge , Oliver Johnson , Jonathan Scarlett

The goal of non-adaptive group testing is to identify at most $d$ defective items from $N$ items, in which a test of a subset of $N$ items is positive if it contains at least one defective item, and negative otherwise. However, in many…

Information Theory · Computer Science 2018-03-19 Thach V. Bui , Tetsuya Kojima , Minoru Kuribayashi , Isao Echizen

We study the problem of group testing with non-identical, independent priors. So far, the pooling strategies that have been proposed in the literature take the following approach: a hand-crafted test design along with a decoding strategy is…

Information Theory · Computer Science 2022-01-31 Sundara Rajan Srinivasavaradhan , Pavlos Nikolopoulos , Christina Fragouli , Suhas Diggavi

Group testing is a well known search problem that consists in detecting up to $s$ defective elements of the set $[t]=\{1,\ldots,t\}$ by carrying out tests on properly chosen subsets of $[t]$. In classical group testing the goal is to find…

Information Theory · Computer Science 2016-07-05 A. G. D'yachkov , I. V. Vorobyev , N. A. Polyanskii , V. Yu. Shchukin

The group testing problem is concerned with identifying a small number $k \sim n^\theta$ for $\theta \in (0,1)$ of infected individuals in a large population of size $n$. At our disposal is a testing procedure that allows us to test groups…

Discrete Mathematics · Computer Science 2019-11-19 Max Hahn-Klimroth , Philipp Loick

Group testing is a well known search problem that consists in detecting up to $s$ defective elements of the set $[t]=\{1,\ldots,t\}$ by carrying out tests on properly chosen subsets of $[t]$. In classical group testing the goal is to find…

Information Theory · Computer Science 2016-11-18 A. G. D'yachkov , I. V. Vorobyev , N. A. Polyanskii , V. Yu. Shchukin

Efficiently counting or detecting defective items is a crucial task in various fields ranging from biological testing to quality control to streaming algorithms. The \emph{group testing estimation problem} concerns estimating the number of…

Data Structures and Algorithms · Computer Science 2023-12-08 Nader H. Bshouty , Tsun-Ming Cheung , Gergely Harcos , Hamed Hatami , Anthony Ostuni

Consider a very large (infinite) population of items, where each item independent from the others is defective with probability p, or good with probability q=1-p. The goal is to identify N good items as quickly as possible. The following…

Other Statistics · Statistics 2018-04-17 Yaakov Malinovsky

In one-stage or non-adaptive group testing, instead of testing every sample unit individually, they are split, bundled in pools, and simultaneously tested. The results are then decoded to infer the states of the individual items. This…

Applications · Statistics 2020-12-04 Christoph Schumacher , Matthias Täufer

Group testing is the combinatorial problem of identifying the defective items in a population by grouping items into test pools. Recently, nonadaptive group testing - where all the test pools must be decided on at the start - has been…

Information Theory · Computer Science 2013-01-31 Matthew Aldridge

In group testing, the goal is to identify a subset of defective items within a larger set of items based on tests whose outcomes indicate whether any defective item is present. This problem is relevant in areas such as medical testing, data…

Information Theory · Computer Science 2020-11-11 Nelvin Tan , Jonathan Scarlett

In the group testing problem the aim is to identify a small set of $k\sim n^\theta$ infected individuals out of a population size $n$, $0<\theta<1$. We avail ourselves of a test procedure capable of testing groups of individuals, with the…

Discrete Mathematics · Computer Science 2021-05-14 Amin Coja-Oghlan , Oliver Gebhard , Max Hahn-Klimroth , Philipp Loick