Combinatorics and Graph Theory

    

A Randomized 1.01241-Approximation Algorithm for Maximum Cut Problem

Authors: Majid Zohrehbandian

Maximum cut problem is a famous combinatorial problem, which its complexity has been heavily studied over the years. Among them is the efficient algorithm of Goemans and Williamson with an approximation factor roughly 1.13823≅1/0.878 (It is most often expressed as 0.878). Their algorithm combines semidefinite programming and a rounding procedure to produce an approximate solution to the maximum cut problem. In this paper, after introducing a new semidefinite programming formulation we present an improved randomized approximation with an approximation factor roughly 1.01241≅1/0.98775 .

Comments: 7 Pages.

Download: PDF

Submission history

[v1] 2021-02-01 09:23:26

Unique-IP document downloads: 209 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus