TY - GEN

T1 - MAX CUT in cubic graphs

AU - Halperin, Eran

AU - Livnat, Dror

AU - Zwick, Uri

N1 - Funding Information:
✩ This research was supported by the Israel Science Foundation (grant no. 246/01). A preliminary version of this paper appeared in [E. Halperin, D. Livnat, U. Zwick, MAX CUT in cubic graphs, in: Proceedings of the 13th Annual ACM–SIAM Symposium on Discrete Algorithms, San Francisco, CA, 2002, pp. 506–513]. * Corresponding author. E-mail addresses: eran@eecs.berkeley.edu (E. Halperin), dror@tau.ac.il (D. Livnat), zwick@tau.ac.il (U. Zwick).

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33645474495&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:33645474495

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 506

EP - 513

BT - Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002

PB - Association for Computing Machinery

T2 - 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002

Y2 - 6 January 2002 through 8 January 2002

ER -