Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Multipackings in Graphs   A vertex subset M of a graph G is a multipacking if for each vertex v, and
each positive integer s less than or equal to the diameter of G, v is within
distance s of at most s vertices of M. The multipacking number of a graph is
the maximum cardinality of a multipacking of G. A generalization of 2-packings,
multipackings offer interesting insight into the minimum cost broadcast
domination problem. This paper surveys recent results in the study of
multipackings, including the equality of the multipacking number and broadcast
number in trees, an extension of Farber's Algorithm for finding dominating sets
and 2-packings of strongly chordal graphs, and some early results on fractional
multipackings. The paper closes with a series of in-depth examples of the
various algorithms presented.

25
The categories of this paper are: patt-sol
36
The categories of this paper are: cmp-lg
30
The categories of this paper are: q-alg
18
The categories of this paper are: econ
16
The categories of this paper are: stat
12
The categories of this paper are: nucl-th
14
The categories of this paper are: math-ph
17
The categories of this paper are: q-fin
15
The categories of this paper are: nucl-ex
24
The categories of this paper are: dg-ga
23
The categories of this paper are: solv-int
31
The categories of this paper are: ao-sci
6
The categories of this paper are: astro-ph
20
The categories of this paper are: acc-phys
9
The categories of this paper are: nlin
33
The categories of this paper are: plasm-ph