2 papers
cs.AI2018
Advancing Tabu and Restart in Local Search for Maximum Weight Cliques
Yi Fan, Nan Li, Chengqian Li +3
The tabu and restart are two fundamental strategies for local search. In this paper, we improve the local search algorithms for solving the Maximum Weight Clique (MWC) problem by i…
cs.DS2015
Exploiting Reduction Rules and Data Structures: Local Search for Minimum Vertex Cover in Massive Graphs
Yi Fan, Chengqian Li, Zongjie Ma +3
The Minimum Vertex Cover (MinVC) problem is a well-known NP-hard problem. Recently there has been great interest in solving this problem on real-world massive graphs. For such grap…