Improved Results for Competitive Group Testing
Combinatorics, Probability and Computing
Searching for two counterfeit coins with two-arms balance
Discrete Applied Mathematics
Searching for a counterfeit coin with two unreliable weighings
Discrete Applied Mathematics - Special issue: Max-algebra
Searching for two counterfeit coins with two-arms balance
Discrete Applied Mathematics
Searching for a counterfeit coin with two unreliable weighings
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
| Hi-index | 0.00 |
In many fault detection problems, the goal is to identify defective items from a set of items with a minimum number of tests. Each test is on a subset of items, which tells whether the subset contains a defective item or not. The concept of competitive algorithm has been developed to relate the properties of the group testing algorithms that assume that the number of defective items $d$ is known, to those without any a priori knowledge on $d$. A new concept of strongly competitive algorithm is defined that relates different characteristics of these two classes of algorithms and present an interesting relationship between the two concepts competitive and strongly competitive. A strongly competitive algorithm is also presented.