An optimal group testing algorithm on \(k\) disjoint sets

DOI10.1016/0167-6377(93)90083-SzbMath0773.90041OpenAlexW1964671934MaRDI QIDQ2367040

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

group testingFermat numbers2-optimal hypergraphs

Mathematics Subject Classification ID

Search theory (90B40)

Related Items (1)

Quaternary splitting algorithm in group testing

Cites Work

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

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