AAAI Publications, Thirty-Second AAAI Conference on Artificial Intelligence

Font Size: 
NuMWVC: A Novel Local Search for Minimum Weighted Vertex Cover Problem
Ruizhi Li, Shaowei Cai, Shuli Hu, Minghao Yin, Jian Gao

Last modified: 2018-04-29


The minimum weighted vertex cover (MWVC) problem is a well known combinatorial optimization problem with important applications. This paper introduces a novel local search algorithm called NuMWVC for MWVC based on three ideas. First, four reduction rules are introduced during the initial construction phase. Second, the configuration checking with aspiration is proposed to reduce cycling problem. Moreover, a self-adaptive vertex removing strategy is proposed to save time.


minimum weighted vertex cover; local search; reduction rules; configuration checking with aspiration; self-adaptive vertex removing strategy

Full Text: PDF