An optimal group testing algorithm on k disjoint sets

DOI10.1016/0167-6377(93)90083-SMaRDI QIDQ2367040zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 16 August 1993

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(93)90083-s

zbMATH Keywords

2-optimal hypergraphsFermat numbersgroup testing

Mathematics Subject Classification ID

Search theory (90B40)

Recommendations

• An efficient algorithm for combinatorial group testing
• Modifications of Competitive Group Testing
• scientific article; zbMATH DE number 819134
• Group testing problem with two defectives

Cites work

• A Group Testing Problem
• A Group Testing Problem on Two Disjoint Sets
• A search problem on graphs which generalizes some group testing problems with two defectives
• Search problems on graphs

Cited in

(5)

• Quaternary splitting algorithm in group testing
• Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs
• Strict group testing and the set basis problem
• scientific article; zbMATH DE number 1200215 (Why is no real title available?)
• Near-Optimal Sparsity-Constrained Group Testing: Improved Bounds and Algorithms

This page was built for publication: An optimal group testing algorithm on \(k\) disjoint sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367040)