Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3

The best approximation algorithm for Max Cut in graphs of maximum degree 3 uses semidefinite programming, has approximation ratio 0.9326, and its running time is (n3.5 log n) ; but the best combinatorial algorithms have approximation ratio 4/5 only, achieved in O(n2) time [Bondy and Locke, J. Graph Theory 10 (1986), 477

• Type: Journal
• Year: 2008
• Where: JDA
• Authors: Cristina Bazgan, Zsolt Tuza
• Keywords: Algorithm, Approximation, Approximation Algorithm, JDA 2008