The tabu and restart are two fundamental strategies for local search. In...
Exploiting Reduction Rules and Data Structures: Local Search for Minimum Vertex Cover in Massive Graphs
The Minimum Vertex Cover (MinVC) problem is a well-known NP-hard problem...
Chengqian Liis this you? claim profile