Improved Results for Competitive Group Testing

DOI10.1017/S0963548304006649zbMath1062.68048OpenAlexW2171327317MaRDI QIDQ4660563

Eberhard Triesch, Jens Schlaghoff

Publication date: 4 April 2005

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548304006649

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorics in computer science (68R05)

Related Items (15)

Randomized Group Testing Both Query-Optimal and Minimal Adaptive ⋮ BOUNDS FOR NONADAPTIVE GROUP TESTS TO ESTIMATE THE AMOUNT OF DEFECTIVES ⋮ Exact learning from an honest teacher that answers membership queries ⋮ A Zig-Zag Approach for Competitive Group Testing ⋮ Synthetic sequence design for signal location search ⋮ Two new perspectives on multi-stage group testing ⋮ Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis ⋮ An improved zig zag approach for competitive group testing ⋮ Upper and lower bounds for competitive group testing ⋮ Learning a hidden graph ⋮ A new strongly competitive group testing algorithm with small sequentiality ⋮ A randomized competitive group testing procedure ⋮ An Efficient Algorithm for Combinatorial Group Testing ⋮ COMPETITIVE GROUP TESTING AND LEARNING HIDDEN VERTEX COVERS WITH MINIMUM ADAPTIVITY ⋮ A new randomized algorithm for group testing with unknown number of defective items

This page was built for publication: Improved Results for Competitive Group Testing