MAX CUT in cubic graphs
Eran Halperin, Dror Livnat, Uri Zwick · Symposium on Discrete Algorithms · 2002
We present an improved semidefinite programming based approximation algorithm for the MAX CUT problem in graphs of maximum degree at most 3. The approximation ratio of the new algorithm is at least 0.9326. This improves, and also somewhat simplifies, a result of Feige, Karpinski and Langberg. We also observe that results of Hopkins and Staton and of Bondy and Locke yield a simple combinatorial 4/5-approximation algorithm for the problem. Slightly improved results would appear in the full version of the paper.