An improved algorithm for quantitative group testing

DOI10.1016/0166-218X(92)90260-HzbMath0761.68071OpenAlexW2066296454MaRDI QIDQ1193729

Luisa Gargano, Ugo Vaccaro, V. Montuori, G. Setaro

Publication date: 27 September 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90260-h

zbMATH Keywords

Fibonaccian algorithmquantitative group testing problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)

Related Items (9)

Search problems: One, two or many rounds ⋮ Optimal detection of a counterfeit coin with multi-arms balances ⋮ Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis ⋮ Signature codes for noisy multiple access adder channel ⋮ Optimal search procedure on coin-weighing problem ⋮ Group testing with unreliable tests ⋮ A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance ⋮ Searching for a counterfeit coin with two unreliable weighings ⋮ Searching for two counterfeit coins with two-arms balance

Cites Work

• Unnamed Item
• Unnamed Item
• Search problems on graphs
• Search problems for two irregular coins with incomplete feedback: The underweight model
• The optimal procedures for quantitative group testing
• Optimal Detection of Two Defectives with a Parity Check Device
• Searching for Two Objects by Underweight Feedback
• Optimal Detection of Two Complementary Defectives

This page was built for publication: An improved algorithm for quantitative group testing