An improved algorithm for quantitative group testing

AbstractGiven a set of n elements two of which are defective, the quantitative group testing problem asks for the search of the defectives under the constraint that the result of each test gives the number of defectives contained in the tested subset. We give an algorithm to solve the quantitative group testing problem that improves on the Fibonaccian algorithm by Christen and Aigner