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. Also various meta-heuristic search methods can sometimes efficiently produce approximate solutions.