Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Algorithms for the Maximum Eulerian Cycle Decomposition Problem   Given an Eulerian graph G, in the Maximum Eulerian Cycle Decomposition
problem, we are interested in finding a collection of edge-disjoint cycles
{E_1, E_2, ..., E_k} in G such that all edges of G are in exactly one cycle and
k is maximum. We present an algorithm to solve the pricing problem of a column
generation Integer Linear Programming (ILP) model introduced by Lancia and
Serafini (2016). Furthermore, we propose a greedy heuristic, which searches for
minimum size cycles starting from a random vertex, and a heuristic based on
partially solving the ILP model. We performed tests comparing the three
approaches in relation to the quality of solutions and execution time, using
distinct sets of Eulerian graphs, each set grouping graphs with different
numbers of vertices and edges. Our experimental results show that the ILP based
heuristic outperforms the other methods.

9
The categories of this paper are: nlin
25
The categories of this paper are: patt-sol
36
The categories of this paper are: cmp-lg
29
The categories of this paper are: funct-an
30
The categories of this paper are: q-alg
12
The categories of this paper are: nucl-th
34
The categories of this paper are: chem-ph
16
The categories of this paper are: stat
3
The categories of this paper are: physics
15
The categories of this paper are: nucl-ex
22
The categories of this paper are: chao-dyn
28
The categories of this paper are: alg-geom
32
The categories of this paper are: atom-ph
0
The categories of this paper are: hep-ph
14
The categories of this paper are: math-ph
20
The categories of this paper are: acc-phys