Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On bounded occurrence constraint satisfaction
Information Processing Letters - Special issue analytical theory of fuzzy control with applications
Gadgets, Approximation, and Linear Programming
SIAM Journal on Computing
Approximation algorithms for MAX 4-SAT and rounding procedures for semidefinite programs
Journal of Algorithms
Computer assisted proof of optimal approximability results
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A 7/8-Approximation Algorithm for MAX 3SAT?
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Improved approximation of max-cut on graphs of bounded degree
Journal of Algorithms
Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs
Fundamenta Informaticae
Bounds on the bisection width for random d -regular graphs
Theoretical Computer Science
On greedy construction heuristics for the MAX-CUT problem
International Journal of Computational Science and Engineering
Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs
Fundamenta Informaticae
| Hi-index | 0.00 |
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.