An Asynchronous Game-based algorithm to the Weighted Vertex Cover of Networks
Kaiyi Luo · 2020
Minimum weighted vertex cover (MWVC) problem of weighted networks is one of the most important combinatorial optimization problems in network optimization. This paper models the MWVC problem as an asymmetric game on weighted networks. Then, an asynchronous game-based algorithm (AGB) is proposed to solve the MWVC problem, which can guarantee to obtain a vertex cover (VC). Numerical illustrations verify the performance of the proposed game solution on the representative weighted networks.