TY - JFULL
AU - S. Balaji and V. Swaminathan and K. Kannan
PY - 2010/8/
TI - An Effective Algorithm for Minimum Weighted Vertex Cover Problem
T2 - International Journal of Mathematical and Computational Sciences
SP - 769
EP - 774
VL - 4
SN - 1307-6892
UR - https://publications.waset.org/pdf/11182
PU - World Academy of Science, Engineering and Technology
NX - Open Science Index 43, 2010
N2 - The Minimum Weighted Vertex Cover (MWVC) problem is a classic graph optimization NP - complete problem. Given an undirected graph G = (V, E) and weighting function defined on the vertex set, the minimum weighted vertex cover problem is to find a vertex set S V whose total weight is minimum subject to every edge of G has at least one end point in S. In this paper an effective algorithm, called Support Ratio Algorithm (SRA), is designed to find the minimum weighted vertex cover of a graph. Computational experiments are designed and conducted to study the performance of our proposed algorithm. Extensive simulation results show that the SRA can yield better solutions than other existing algorithms found in the literature for solving the minimum vertex cover problem.
ER -