Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Capacitated Domination: Constant Factor Approximation for Planar Graphs   We consider the capacitated domination problem, which models a
service-requirement assigning scenario and which is also a generalization of
the dominating set problem. In this problem, we are given a graph with three
parameters defined on the vertex set, which are cost, capacity, and demand. The
objective of this problem is to compute a demand assignment of least cost, such
that the demand of each vertex is fully-assigned to some of its closed
neighbours without exceeding the amount of capacity they provide.
  In this paper, we provide the first constant factor approximation for this
problem on planar graphs, based on a new perspective on the hierarchical
structure of outer-planar graphs. We believe that this new perspective and
technique can be applied to other capacitated covering problems to help tackle
vertices of large degrees.

15
The categories of this paper are: nucl-ex
20
The categories of this paper are: acc-phys
24
The categories of this paper are: dg-ga
19
The categories of this paper are: eess
30
The categories of this paper are: q-alg
32
The categories of this paper are: atom-ph
35
The categories of this paper are: mtrl-th
21
The categories of this paper are: adap-org
17
The categories of this paper are: q-fin
29
The categories of this paper are: funct-an
4
The categories of this paper are: cond-mat
27
The categories of this paper are: comp-gas
8
The categories of this paper are: hep-ex
13
The categories of this paper are: quant-ph
12
The categories of this paper are: nucl-th
5
The categories of this paper are: gr-qc