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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Richter, S., Helmert, M., & Gretton, C. (2007). A stochastic local search approach to vertex cover. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4667 LNAI, pp. 412–426). Springer Verlag. https://doi.org/10.1007/978-3-540-74565-5_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
