Minimizing a Combinatorial Function

DOI10.1137/0603053MaRDI QIDQ4739915zbMATH OpenOpenAlexFDO

Authors Du Ding-Zhu, Frank K. Hwang

Publication date 1982

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

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

zbMATH Keywords

group testingidentification of defectivesminimization problem

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10)

Cites work

• A Boundary Problem for Group Testing

Cited in

(7)

• Group testing to identify one defective and one mediocre item
• On the cut-off point for combinatorial group testing
• Competitive group testing
• Upper and lower bounds for competitive group testing
• An efficient algorithm for combinatorial group testing
• A new adaptive algorithm for competitive group testing
• Selecting two different defective coins

This page was built for publication: Minimizing a Combinatorial Function

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