A Stochastic Local Search Approach to Vertex Cover

We introduce a novel stochastic local search algorithm for the vertex cover problem. Compared to current exhaustive search techniques, our algorithm achieves excellent performance on a suite of problems drawn from the field of biology. We also evaluate our performance on the commonly used DIMACS benchmarks for the related clique problem, finding that our approach is competitive with the current best stochastic local search algorithm for finding cliques. On three very large problem instances, our algorithm establishes new records in solution quality.

• Type: Conference
• Year: 2007
• Where: KI
• Authors: Silvia Richter, Malte Helmert, Charles Gretton
• Keywords: KI 2007, Local Search Algorithm, Stochastic Local Search, Vertex Cover Problem