Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity

DOI10.1007/978-3-642-03409-1_9zbMath1252.68208OpenAlexW1547622281MaRDI QIDQ3183599

Peter Damaschke, Azam Sheikh Muhammad

Publication date: 20 October 2009

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03409-1_9

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (2)

Optimal deterministic group testing algorithms to estimate the number of defectives ⋮ Optimal deterministic group testing algorithms to estimate the number of defectives

This page was built for publication: Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity