Improved greedy-edge approximation algorithm of the optimal vertex-cover
改进的最优顶点覆盖贪心边近似算法

The Mininum Vertex Cover problem is one of the six "basic" NP-complete problem, it cannot be solved in polynomial time,unless N=NP.The algorithm of this paper solved vertex cover problem from another point of view.It improved the Greedy-Edge Approximation Algorithm,proved and discussed that the approximation factor of the Improved Greedy-Edge Approximation Algorithm containing the number of Single point Greedy-Edge and the number of Double point Greedy-Edge was not more than 2.