| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438892 | Theoretical Computer Science | 2012 | 9 Pages |
Abstract
Recently, various randomized search heuristics have been studied for the solution of the minimum vertex cover problem, in particular for sparse random instances according to the G(n,c/n) model, where c>0 is a constant. Methods from statistical physics suggest that the problem is easy if c
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
