Upper and lower bounds for competitive group testing

DOI10.1016/j.dam.2023.03.014OpenAlexW3111845413MaRDI QIDQ2700623

Eberhard Triesch, Robert Scheidweiler

Publication date: 27 April 2023

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

Full work available at URL: https://arxiv.org/abs/2012.02630

zbMATH Keywords

boundsgroup testingcompetitive algorithm

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Applications of statistics (62P99) Operations research and management science (90B99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the cut-off point for combinatorial group testing
• Competitive group testing
• COMPETITIVE GROUP TESTING AND LEARNING HIDDEN VERTEX COVERS WITH MINIMUM ADAPTIVITY
• Modifications of Competitive Group Testing
• Improved Results for Competitive Group Testing
• Minimizing a Combinatorial Function
• A Boundary Problem for Group Testing
• An Efficient Algorithm for Combinatorial Group Testing
• Sharper bounds in adpative group testing

This page was built for publication: Upper and lower bounds for competitive group testing