Combinatorial search
Discrete Applied Mathematics - ARIDAM IV and V
Modifications of Competitive Group Testing
SIAM Journal on Computing
A new competitive algorithm for group testing
Discrete Applied Mathematics
SIAM Journal on Computing
A group testing problem for hypergraphs of bounded rank
Discrete Applied Mathematics
Competitive group testing and learning hidden vertex covers with minimum adaptivity
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Bounds for nonadaptive group tests to estimate the amount of defectives
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Randomized group testing both query-optimal and minimal adaptive
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Synthetic sequence design for signal location search
RECOMB'12 Proceedings of the 16th Annual international conference on Research in Computational Molecular Biology
An efficient algorithm for combinatorial group testing
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.00 |
We consider algorithms for group testing problems when nothing is known in advance about the number of defectives. Du and Hwang suggested measuring the quality of such algorithms by its so-called (first) competitive ratio (see the Introduction). Later, Du and Park suggested a second kind of competitive ratio. For each kind of competitiveness, we improve the best-known bounds: in the first case, from 1.65 to $1.5+\ep$, and in the second from 16 to 4.