Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Approximation Algorithms for the Connected Sensor Cover Problem   We study the minimum connected sensor cover problem (MIN-CSC) and the
budgeted connected sensor cover (Budgeted-CSC) problem, both motivated by
important applications (e.g., reduce the communication cost among sensors) in
wireless sensor networks. In both problems, we are given a set of sensors and a
set of target points in the Euclidean plane. In MIN-CSC, our goal is to find a
set of sensors of minimum cardinality, such that all target points are covered,
and all sensors can communicate with each other (i.e., the communication graph
is connected). We obtain a constant factor approximation algorithm, assuming
that the ratio between the sensor radius and communication radius is bounded.
In Budgeted-CSC problem, our goal is to choose a set of $B$ sensors, such that
the number of targets covered by the chosen sensors is maximized and the
communication graph is connected. We also obtain a constant approximation under
the same assumption.

26
The categories of this paper are: bayes-an
8
The categories of this paper are: hep-ex
2
The categories of this paper are: math
3
The categories of this paper are: physics
15
The categories of this paper are: nucl-ex
25
The categories of this paper are: patt-sol
20
The categories of this paper are: acc-phys
32
The categories of this paper are: atom-ph
13
The categories of this paper are: quant-ph
34
The categories of this paper are: chem-ph
0
The categories of this paper are: hep-ph
21
The categories of this paper are: adap-org
28
The categories of this paper are: alg-geom
24
The categories of this paper are: dg-ga
37
The categories of this paper are: supr-con
17
The categories of this paper are: q-fin