Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Max-Cut approximation using a graph based MBO scheme   The Max-Cut problem is a well known combinatorial optimization problem. In
this paper we describe a fast approximation method. Given a graph G, we want to
find a cut whose size is maximal among all possible cuts. A cut is a partition
of the vertex set of G into two disjoint subsets. For an unweighted graph, the
size of the cut is the number of edges that have one vertex on either side of
the partition; we also consider a weighted version of the problem where each
edge contributes a nonnegative weight to the cut. We introduce the signless
Ginzburg-Landau functional and prove that this functional Gamma-converges to a
Max-Cut objective functional. We approximately minimize this functional using a
graph based signless Merriman-Bence-Osher scheme, which uses a signless
Laplacian. We show experimentally that on some classes of graphs the resulting
algorithm produces more accurate maximum cut approximations than the current
state-of-the-art approximation algorithm. One of our methods of minimizing the
functional results in an algorithm with a time complexity of O(|E|), where |E|
is the total number of edges on G.

9
The categories of this paper are: nlin
5
The categories of this paper are: gr-qc
6
The categories of this paper are: astro-ph
32
The categories of this paper are: atom-ph
30
The categories of this paper are: q-alg
11
The categories of this paper are: hep-lat
21
The categories of this paper are: adap-org
26
The categories of this paper are: bayes-an
31
The categories of this paper are: ao-sci
22
The categories of this paper are: chao-dyn
12
The categories of this paper are: nucl-th
37
The categories of this paper are: supr-con
18
The categories of this paper are: econ
10
The categories of this paper are: q-bio
13
The categories of this paper are: quant-ph
0
The categories of this paper are: hep-ph