A (1.999999)-approximation ratio for vertex cover problem
Preprint
Abstract
Until the authenticity of the unique games conjecture is proven, it can be thought to be false. Therefore, I request you, dear reader, to read this paper carefully, and if you don't find any mistake in it, think about the option that maybe unique games conjecture is not correct! If the unique games conjecture is true then it is impossible to produce a less than 2 approximation ratio for the vertex cover problem. Vertex cover problem is a famous combinatorial problem, which its complexity has been heavily studied over the years and while a 2-approximation for it can be trivially obtained, researchers have not been able to approximate it better than 2-\textit{o}(1). In this paper, by a combination of a new semidefinite programming formulation along with satisfying new proposed properties, we introduce an approximation algorithm for the vertex cover problem with a performance ratio of 1.999999 on arbitrary graphs, en route to answering an open question about the unique games conjecture.Keywords
All Related Versions
This publication has 3 references indexed in Scilit:
- Vertex cover might be hard to approximate to withinJournal of Computer and System Sciences, 2008
- On the hardness of approximating vertex coverAnnals of Mathematics, 2005
- Vertex packings: Structural properties and algorithmsMathematical Programming, 1975