NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover

doi:10.1613/jair.3907

CORC > 北京大学 > 信息科学技术学院

	NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover
	Cai, Shaowei ; Su, Kaile ; Luo, Chuan ; Sattar, Abdul
刊名	journal of artificial intelligence research
	2013
关键词	MAXIMUM CLIQUE PROBLEM INDEPENDENT SET PROBLEM RANDOM CONSTRAINT SATISFACTION EXACT PHASE-TRANSITIONS CONFIGURATION CHECKING TABU SEARCH MAX-SAT HARD OPTIMIZATION HEURISTICS
DOI	10.1613/jair.3907
英文摘要	The Minimum Vertex Cover (MVC) problem is a prominent NP-hard combinatorial optimization problem of great importance in both theory and application. Local search has proved successful for this problem. However, there are two main drawbacks in state-of-the-art MVC local search algorithms. First, they select a pair of vertices to exchange simultaneously, which is time-consuming. Secondly, although using edge weighting techniques to diversify the search, these algorithms lack mechanisms for decreasing the weights. To address these issues, we propose two new strategies: two-stage exchange and edge weighting with forgetting. The two-stage exchange strategy selects two vertices to exchange separately and performs the exchange in two stages. The strategy of edge weighting with forgetting not only increases weights of uncovered edges, but also decreases some weights for each edge periodically. These two strategies are used in designing a new MVC local search algorithm, which is referred to as NuMVC. We conduct extensive experimental studies on the standard benchmarks, namely DIMACS and BHOSLIB. The experiment comparing NuMVC with state-of-the-art heuristic algorithms show that NuMVC is at least competitive with the nearest competitor namely PLS on the DIMACS benchmark, and clearly dominates all competitors on the BHOSLIB benchmark. Also, experimental results indicate that NuMVC finds an optimal solution much faster than the current best exact algorithm for Maximum Clique on random instances as well as some structured ones. Moreover, we study the effectiveness of the two strategies and the run-time behaviour through experimental analysis.; Computer Science, Artificial Intelligence; SCI(E); EI; 10; ARTICLE; 687-716; 46
语种	英语
内容类型	期刊论文
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/392304]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Cai, Shaowei,Su, Kaile,Luo, Chuan,et al. NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover[J]. journal of artificial intelligence research,2013.
APA	Cai, Shaowei,Su, Kaile,Luo, Chuan,&Sattar, Abdul.(2013).NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover.journal of artificial intelligence research.
MLA	Cai, Shaowei,et al."NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover".journal of artificial intelligence research (2013).