Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Partitioning Graph Drawings and Triangulated Simple Polygons into
  Greedily Routable Regions   A greedily routable region (GRR) is a closed subset of $\mathbb R^2$, in
which each destination point can be reached from each starting point by
choosing the direction with maximum reduction of the distance to the
destination in each point of the path.
  Recently, Tan and Kermarrec proposed a geographic routing protocol for dense
wireless sensor networks based on decomposing the network area into a small
number of interior-disjoint GRRs. They showed that minimum decomposition is
NP-hard for polygons with holes.
  We consider minimum GRR decomposition for plane straight-line drawings of
graphs. Here, GRRs coincide with self-approaching drawings of trees, a drawing
style which has become a popular research topic in graph drawing. We show that
minimum decomposition is still NP-hard for graphs with cycles, but can be
solved optimally for trees in polynomial time. Additionally, we give a
2-approximation for simple polygons, if a given triangulation has to be
respected.

7
The categories of this paper are: hep-th
8
The categories of this paper are: hep-ex
15
The categories of this paper are: nucl-ex
30
The categories of this paper are: q-alg
2
The categories of this paper are: math
9
The categories of this paper are: nlin
18
The categories of this paper are: econ
23
The categories of this paper are: solv-int
29
The categories of this paper are: funct-an
22
The categories of this paper are: chao-dyn
36
The categories of this paper are: cmp-lg
37
The categories of this paper are: supr-con
33
The categories of this paper are: plasm-ph
19
The categories of this paper are: eess
5
The categories of this paper are: gr-qc
16
The categories of this paper are: stat