A Max-Cut approximation using a graph based MBO scheme

Blaine Keetch, Yves van Gennip

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…