A greedy adaptive algorithm identifies the infected subset in O(H(X)+mu) expected tests for any correlated infection distribution over a hypergraph, with extensions to semi-non-adaptive and noisy settings.
Group testing with prior statistics
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Group Testing with General Correlation Using Hypergraphs
A greedy adaptive algorithm identifies the infected subset in O(H(X)+mu) expected tests for any correlated infection distribution over a hypergraph, with extensions to semi-non-adaptive and noisy settings.