Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL Algorithm
Data Structures and Algorithms
2022-06-23 v1 Computational Complexity
Abstract
In this note, we describe a -factor approximation algorithm for Max-Cut on weighted graphs of degree . Here, is the worst-case approximation ratio of the Goemans-Williamson rounding for Max-Cut. This improves on previous results for unweighted graphs by Feige, Karpinski, and Langberg and Flor\'en. Our guarantee is obtained by a tighter analysis of the solution obtained by applying a natural local improvement procedure to the Goemans-Williamson rounding of the basic SDP strengthened with triangle inequalities.
Cite
@article{arxiv.2206.09204,
title = {Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL Algorithm},
author = {Jun-Ting Hsieh and Pravesh K. Kothari},
journal= {arXiv preprint arXiv:2206.09204},
year = {2022}
}