Consequently no polynomial-time algorithms for max-cut can be expected, however, various meta-heuristic search methods can efficiently produce approximate solutions.
Consequently no polynomial-time algorithms for max-cut can be expected various meta. This was however. Heuristic search methods can efficiently produce approximate solutions. This was however.