A Boundary Problem for Group Testing

DOI10.1137/0602011zbMath0506.05002OpenAlexW1964876289WikidataQ60962391 ScholiaQ60962391MaRDI QIDQ4742787

Menchang Hu, Ju-kwei Wang, Frank K. Hwang

Publication date: 1981

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0602011

zbMATH Keywords

minimax group testing algorithm

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15)

Related Items (7)

Upper and lower bounds for competitive group testing ⋮ An Efficient Algorithm for Combinatorial Group Testing ⋮ Quaternary splitting algorithm in group testing ⋮ On the cut-off point for combinatorial group testing ⋮ Minimizing a Combinatorial Function ⋮ Competitive group testing ⋮ Hypergeometric and Generalized Hypergeometric Group Testing

Cites Work

• Unnamed Item

This page was built for publication: A Boundary Problem for Group Testing