Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: New algorithms for the Minimum Coloring Cut Problem   The Minimum Coloring Cut Problem is defined as follows: given a connected
graph G with colored edges, find an edge cut E' of G (a minimal set of edges
whose removal renders the graph disconnected) such that the number of colors
used by the edges in E' is minimum. In this work, we present two approaches
based on Variable Neighborhood Search to solve this problem. Our algorithms are
able to find all the optimum solutions described in the literature.

32
The categories of this paper are: atom-ph
10
The categories of this paper are: q-bio
0
The categories of this paper are: hep-ph
7
The categories of this paper are: hep-th
35
The categories of this paper are: mtrl-th
13
The categories of this paper are: quant-ph
29
The categories of this paper are: funct-an
23
The categories of this paper are: solv-int
18
The categories of this paper are: econ
26
The categories of this paper are: bayes-an
12
The categories of this paper are: nucl-th
11
The categories of this paper are: hep-lat
25
The categories of this paper are: patt-sol
34
The categories of this paper are: chem-ph
4
The categories of this paper are: cond-mat
15
The categories of this paper are: nucl-ex