An Efficient Algorithm for Combinatorial Group Testing

DOI10.1007/978-3-642-36899-8_29zbMath1309.05038OpenAlexW2226661047MaRDI QIDQ4915259

Andreas Allemann

Publication date: 9 April 2013

Published in: Information Theory, Combinatorics, and Search Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36899-8_29

zbMATH Keywords

competitive analysisgroup testingnested algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Other designs, configurations (05B30)

Related Items (2)

Upper and lower bounds for competitive group testing ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Competitive group testing
• A group testing problem for hypergraphs of bounded rank
• Improved Results for Competitive Group Testing
• Minimizing a Combinatorial Function
• A Boundary Problem for Group Testing
• A Method for Detecting All Defective Members in a Population by Group Testing
• Sharper bounds in adpative group testing

This page was built for publication: An Efficient Algorithm for Combinatorial Group Testing