A Boundary Problem for Group Testing

DOI10.1137/0602011zbMATH Open0506.05002OpenAlexW1964876289WikidataQ60962391 ScholiaQ60962391MaRDI QIDQ4742787FDOQ4742787

Authors: 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)

Cites Work

• Title not available (Why is that?)

Cited In (7)

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

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

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