Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Designing Practical PTASes for Minimum Feedback Vertex Set in Planar
  Graphs   We present two algorithms for the minimum feedback vertex set problem in
planar graphs: an $O(n \log n)$ PTAS using a linear kernel and balanced
separator, and a heuristic algorithm using kernelization and local search. We
implemented these algorithms and compared their performance with Becker and
Geiger's 2-approximation algorithm. We observe that while our PTAS is
competitive with the 2-approximation algorithm on large planar graphs, its
running time is much longer. And our heuristic algorithm can outperform the
2-approximation algorithm on most large planar graphs and provide a trade-off
between running time and solution quality, i.e. a "PTAS behavior".

12
The categories of this paper are: nucl-th
16
The categories of this paper are: stat
20
The categories of this paper are: acc-phys
27
The categories of this paper are: comp-gas
30
The categories of this paper are: q-alg
6
The categories of this paper are: astro-ph
28
The categories of this paper are: alg-geom
7
The categories of this paper are: hep-th
18
The categories of this paper are: econ
21
The categories of this paper are: adap-org
24
The categories of this paper are: dg-ga
0
The categories of this paper are: hep-ph
32
The categories of this paper are: atom-ph
5
The categories of this paper are: gr-qc
10
The categories of this paper are: q-bio
9
The categories of this paper are: nlin