Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Upper and Lower Bounds for Competitive Group Testing   We consider competitive algorithms for adaptive group testing problems. In
the first part of the paper, we develop an algorithm with competitive constant
c < 1.452 thus improving the up to now best known algorithms with constants
1.5+epsilon from 2003. In the second part, we prove the first nontrivial lower
bound for competitive constants, namely that c is always larger than 1.31.

9
The categories of this paper are: nlin
16
The categories of this paper are: stat
19
The categories of this paper are: eess
18
The categories of this paper are: econ
4
The categories of this paper are: cond-mat
11
The categories of this paper are: hep-lat
13
The categories of this paper are: quant-ph
7
The categories of this paper are: hep-th
34
The categories of this paper are: chem-ph
25
The categories of this paper are: patt-sol
24
The categories of this paper are: dg-ga
8
The categories of this paper are: hep-ex
20
The categories of this paper are: acc-phys
33
The categories of this paper are: plasm-ph
23
The categories of this paper are: solv-int
29
The categories of this paper are: funct-an