Approximating Maximum Weighted Independent Set Using Vertex Support

S. Balaji, V. Swaminathan, K. Kannan
2009 Zenodo  
The Maximum Weighted Independent Set (MWIS) problem is a classic graph optimization NP-hard problem. Given an undirected graph G = (V, E) and weighting function defined on the vertex set, the MWIS problem is to find a vertex set S V whose total weight is maximum subject to no two vertices in S are adjacent. This paper presents a novel approach to approximate the MWIS of a graph using minimum weighted vertex cover of the graph. Computational experiments are designed and conducted to study the
more » ... formance of our proposed algorithm. Extensive simulation results show that the proposed algorithm can yield better solutions than other existing algorithms found in the literature for solving the MWIS.
doi:10.5281/zenodo.1078659 fatcat:letlh2m3lrf6bmlz25apzgmxzm