Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Abstract Milling with Turn Costs   The Abstract Milling problem is a natural and quite general graph-theoretic
model for geometric milling problems. Given a graph, one asks for a walk that
covers all its vertices with a minimum number of turns, as specified in the
graph model by a 0/1 turncost function fx at each vertex x giving, for each
ordered pair of edges (e,f) incident at x, the turn cost at x of a walk that
enters the vertex on edge e and departs on edge f. We describe an initial study
of the parameterized complexity of the problem. Our main positive result shows
that Abstract Milling, parameterized by: number of turns, treewidth and maximum
degree, is fixed-parameter tractable, We also show that Abstract Milling
parameterized by (only) the number of turns and the pathwidth, is hard for W[1]
-- one of the few parameterized intractability results for bounded pathwidth.

5
The categories of this paper are: gr-qc
7
The categories of this paper are: hep-th
14
The categories of this paper are: math-ph
19
The categories of this paper are: eess
35
The categories of this paper are: mtrl-th
6
The categories of this paper are: astro-ph
32
The categories of this paper are: atom-ph
16
The categories of this paper are: stat
26
The categories of this paper are: bayes-an
2
The categories of this paper are: math
8
The categories of this paper are: hep-ex
33
The categories of this paper are: plasm-ph
31
The categories of this paper are: ao-sci
17
The categories of this paper are: q-fin
20
The categories of this paper are: acc-phys
12
The categories of this paper are: nucl-th