Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Exact and approximate algorithms for movement problems on (special
  classes of) graphs   When a large collection of objects (e.g., robots, sensors, etc.) has to be
deployed in a given environment, it is often required to plan a coordinated
motion of the objects from their initial position to a final configuration
enjoying some global property. In such a scenario, the problem of minimizing
some function of the distance travelled, and therefore energy consumption, is
of vital importance. In this paper we study several motion planning problems
that arise when the objects must be moved on a graph, in order to reach certain
goals which are of interest for several network applications. Among the others,
these goals include broadcasting messages and forming connected or
interference-free networks. We study these problems with the aim of minimizing
a number of natural measures such as the average/overall distance travelled,
the maximum distance travelled, or the number of objects that need to be moved.
To this respect, we provide several approximability and inapproximability
results, most of which are tight.

2
The categories of this paper are: math
37
The categories of this paper are: supr-con
10
The categories of this paper are: q-bio
7
The categories of this paper are: hep-th
15
The categories of this paper are: nucl-ex
29
The categories of this paper are: funct-an
19
The categories of this paper are: eess
26
The categories of this paper are: bayes-an
16
The categories of this paper are: stat
12
The categories of this paper are: nucl-th
25
The categories of this paper are: patt-sol
0
The categories of this paper are: hep-ph
28
The categories of this paper are: alg-geom
20
The categories of this paper are: acc-phys
14
The categories of this paper are: math-ph
13
The categories of this paper are: quant-ph