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

Cristina Bazgan, Z. Tuza

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

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 [J.A. Bondy, S.C. Locke, J. Graph Theory 10 (1986) 477-504; E. Halperin, et al., J. Algorithms 53 (2004) 169-185]. Here we present an improved combinatorial approximation, which is a 5/6-approximation algorithm that runs in O (n2) time, perhaps improvable even to O (n). Our main tool is a new type of vertex decomposition for graphs of maximum degree 3.

Original languageEnglish
Pages (from-to)510-519
Number of pages10
JournalJournal of Discrete Algorithms
Volume6
Issue number3
DOIs
Publication statusPublished - Sep 2008

Fingerprint

Max-cut
Approximation algorithms
Maximum Degree
Approximation Algorithms
Approximation
Graph in graph theory
Combinatorial Algorithms
Graph theory
Semidefinite Programming
Best Approximation
Decomposition
Decompose
Vertex of a graph

Keywords

  • Approximation algorithm
  • Cubic graph
  • Maximum cut
  • Unicyclic graph
  • Vertex decomposition

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3. / Bazgan, Cristina; Tuza, Z.

In: Journal of Discrete Algorithms, Vol. 6, No. 3, 09.2008, p. 510-519.

Research output: Contribution to journalArticle

@article{c961dae999924ce7b2cb9b1e3a2ccf78,
title = "Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3",
abstract = "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 [J.A. Bondy, S.C. Locke, J. Graph Theory 10 (1986) 477-504; E. Halperin, et al., J. Algorithms 53 (2004) 169-185]. Here we present an improved combinatorial approximation, which is a 5/6-approximation algorithm that runs in O (n2) time, perhaps improvable even to O (n). Our main tool is a new type of vertex decomposition for graphs of maximum degree 3.",
keywords = "Approximation algorithm, Cubic graph, Maximum cut, Unicyclic graph, Vertex decomposition",
author = "Cristina Bazgan and Z. Tuza",
year = "2008",
month = "9",
doi = "10.1016/j.jda.2007.02.002",
language = "English",
volume = "6",
pages = "510--519",
journal = "Journal of Discrete Algorithms",
issn = "1570-8667",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

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

AU - Bazgan, Cristina

AU - Tuza, Z.

PY - 2008/9

Y1 - 2008/9

N2 - 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 [J.A. Bondy, S.C. Locke, J. Graph Theory 10 (1986) 477-504; E. Halperin, et al., J. Algorithms 53 (2004) 169-185]. Here we present an improved combinatorial approximation, which is a 5/6-approximation algorithm that runs in O (n2) time, perhaps improvable even to O (n). Our main tool is a new type of vertex decomposition for graphs of maximum degree 3.

AB - 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 [J.A. Bondy, S.C. Locke, J. Graph Theory 10 (1986) 477-504; E. Halperin, et al., J. Algorithms 53 (2004) 169-185]. Here we present an improved combinatorial approximation, which is a 5/6-approximation algorithm that runs in O (n2) time, perhaps improvable even to O (n). Our main tool is a new type of vertex decomposition for graphs of maximum degree 3.

KW - Approximation algorithm

KW - Cubic graph

KW - Maximum cut

KW - Unicyclic graph

KW - Vertex decomposition

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

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

U2 - 10.1016/j.jda.2007.02.002

DO - 10.1016/j.jda.2007.02.002

M3 - Article

AN - SCOPUS:47549118371

VL - 6

SP - 510

EP - 519

JO - Journal of Discrete Algorithms

JF - Journal of Discrete Algorithms

SN - 1570-8667

IS - 3

ER -