A Near Optimal Approximation Algorithm for Vertex-Cover Problem

TL;DR

This paper presents a polynomial-time approximation algorithm for the Vertex-Cover problem that improves approximation quality and efficiency, with potential benefits for related problems like independent set.

Contribution

The paper introduces a new approximation algorithm for Vertex-Cover with better approximation ratio and efficiency, supported by theoretical proofs and examples.

Findings

Improves approximation for Vertex-Cover problem

Achieves worst-case time complexity of Θ(V^2)

Enhances algorithms for independent set problem

Abstract

Recently, there has been increasing interest and progress in improvising the approximation algorithm for well-known NP-Complete problems, particularly the approximation algorithm for the Vertex-Cover problem. Here we have proposed a polynomial time efficient algorithm for vertex-cover problem for more approximate to the optimal solution, which lead to the worst time complexity ?{\theta}(V 2) and space complexity ?{\theta}(V + E). We show that our proposed method is more approximate with example and theorem proof. Our algorithm also induces improvement on previous algorithms for the independent set problem on graphs of small and high degree.