Mastan, Shaik; Balakrishna, U.; Raju, G. Sankar Sekhar; … - 2021
The minimum weight vertex cover problem (MWVCP) is well known combinatorial optimization problem that has several practical applications and formally defined as: Given an undirected graph with a set of vertices and edges, each vertex is assigned bya positive weight, the MWVCP aims to find a...