An Approximation Algorithm for Minimum Weighted Vertex Cover Problem

Based on the Dijkasta algorithm,this paper gives an approximation algorithm for the minimum weighted vertex cover problem.First,let an arbitrary vertex be the initial point,and the allowed set and some definitions are given.Then,by using he Dijkasta algorithm to get the shortest path from the initial point to each vertex in the allowed set,and obtain the vertex cover in accordance with certain principles.In the end,an example is given to illustrate the rationality and effectiveness of the algorithm.