A Stochastic Local Search Approach to Vertex Cover

  • Authors:

  • Silvia Richter;Malte Helmert;Charles Gretton

  • Affiliations:

  • NICTA, 300 Adelaide St, Brisbane QLD 4000, Australia and Institute for Integrated and Intelligent Systems, Griffith University, 170 Kessels Road, Nathan QLD 4111, Australia;Albert-Ludwigs-Universität Freiburg, Georges-Köhler-Allee 052, 79110 Freiburg, Germany;NICTA, 300 Adelaide St, Brisbane QLD 4000, Australia

  • Venue:
  • KI '07 Proceedings of the 30th annual German conference on Advances in Artificial Intelligence
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.