A randomized 1.01241-approximation algorithm for maximum cut problem

Autor:	zohrehbandian, Majid
Rok vydání:	2021
DOI:	10.5281/zenodo.4486640
Popis:	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
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f1da4155422d67398406b0f8c60a9fa8 Zobrazit plný text záznamu