MAX CUT in cubic graphs

Eran Halperin; Dror Livnat; Uri Zwick

MAX CUT in cubic graphs

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

7 Scopus citations

Abstract

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.

Original language	English
Title of host publication	Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002
Publisher	Association for Computing Machinery
Pages	506-513
Number of pages	8
ISBN (Electronic)	089871513X
State	Published - 2002
Event	13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002 - San Francisco, United States Duration: 6 Jan 2002 → 8 Jan 2002

Publication series

Name	Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
Volume	06-08-January-2002

Conference

Conference	13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002
Country/Territory	United States
City	San Francisco
Period	6/01/02 → 8/01/02

Funding

Funders	Funder number
Israel Science Foundation	246/01

Cite this

@inproceedings{6d481264447e48a29cd3e4d3e9601020,

title = "MAX CUT in cubic graphs",

abstract = "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.",

author = "Eran Halperin and Dror Livnat and Uri Zwick",

note = "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: [email protected] (E. Halperin), [email protected] (D. Livnat), [email protected] (U. Zwick).; 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002 ; Conference date: 06-01-2002 Through 08-01-2002",

year = "2002",

language = "אנגלית",

series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

publisher = "Association for Computing Machinery",

pages = "506--513",

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

}

Halperin, E, Livnat, D & Zwick, U 2002, MAX CUT in cubic graphs. in Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 06-08-January-2002, Association for Computing Machinery, pp. 506-513, 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002, San Francisco, United States, 6/01/02.

MAX CUT in cubic graphs. / Halperin, Eran; Livnat, Dror; Zwick, Uri.
Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002. Association for Computing Machinery, 2002. p. 506-513 (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; Vol. 06-08-January-2002).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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: [email protected] (E. Halperin), [email protected] (D. Livnat), [email protected] (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 -

MAX CUT in cubic graphs

Abstract

Publication series

Conference

Funding

Other files and links

Fingerprint

Cite this