Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Approximation Algorithm for N-distance Minimal Vertex Cover Problem   Evolution of large scale networks demand for efficient way of communication
in the networks. One way to propagate information in the network is to find
vertex cover. In this paper we describe a variant of vertex cover problem
naming it N-distance Vertex Minimal Cover(N-MVC) Problem to optimize
information propagation throughout the network. A minimum subset of vertices of
a unweighted and undirected graph G = (V, E) is called N-MVC if for all v in V
, v is at distance less than or equal to N from at least one of the the
vertices in N-MVC. In the following paper, this problem is defined, formulated
and an approximation algorithm is proposed with discussion on its correctness
and upper bound.

8
The categories of this paper are: hep-ex
27
The categories of this paper are: comp-gas
6
The categories of this paper are: astro-ph
13
The categories of this paper are: quant-ph
11
The categories of this paper are: hep-lat
4
The categories of this paper are: cond-mat
24
The categories of this paper are: dg-ga
35
The categories of this paper are: mtrl-th
22
The categories of this paper are: chao-dyn
28
The categories of this paper are: alg-geom
30
The categories of this paper are: q-alg
10
The categories of this paper are: q-bio
9
The categories of this paper are: nlin
26
The categories of this paper are: bayes-an
3
The categories of this paper are: physics
23
The categories of this paper are: solv-int