Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Experimental Evaluation of Parameterized Algorithms for Feedback Vertex
  Set   Feedback Vertex Set is a classic combinatorial optimization problem that asks
for a minimum set of vertices in a given graph whose deletion makes the graph
acyclic. From the point of view of parameterized algorithms and fixed-parameter
tractability, Feedback Vertex Set is one of the landmark problems: a long line
of study resulted in multiple algorithmic approaches and deep understanding of
the combinatorics of the problem. Because of its central role in parameterized
complexity, the first edition of the Parameterized Algorithms and Computational
Experiments Challenge (PACE) in 2016 featured Feedback Vertex Set as the
problem of choice in one of its tracks. The results of PACE 2016 on one hand
showed large discrepancy between performance of different classic approaches to
the problem, and on the other hand indicated a new approach based on
half-integral relaxations of the problem as probably the most efficient
approach to the problem. In this paper we provide an exhaustive experimental
evaluation of fixed-parameter and branching algorithms for Feedback Vertex Set.

8
The categories of this paper are: hep-ex
35
The categories of this paper are: mtrl-th
17
The categories of this paper are: q-fin
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
33
The categories of this paper are: plasm-ph
15
The categories of this paper are: nucl-ex
2
The categories of this paper are: math
30
The categories of this paper are: q-alg
22
The categories of this paper are: chao-dyn
0
The categories of this paper are: hep-ph
4
The categories of this paper are: cond-mat
3
The categories of this paper are: physics
32
The categories of this paper are: atom-ph
5
The categories of this paper are: gr-qc