An Asynchronous Game-based algorithm to the Weighted Vertex Cover of Networks

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 s...

Full description

Saved in:
Bibliographic Details
Published in2020 International Conference on Computer Engineering and Intelligent Control (ICCEIC) pp. 145 - 148
Main Author Luo, Kaiyi
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2020
Subjects
asynchronous game-based algorithm
Computational modeling
Distributed algorithms
game theory
Games
Intelligent control
minimum weighted vertex cover
numerical illustrations
Numerical models
Numerical simulation
Optimization
Online AccessGet full text
DOI10.1109/ICCEIC51584.2020.00036

Cover

More Information
Summary: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.
DOI:10.1109/ICCEIC51584.2020.00036