158 search results - page 4 / 32 » Evolutionary algorithms and the Vertex Cover problem |
100
click to vote
APPROX
2008
Springer
14 years 12 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
WDAG
2009
Springer
15 years 4 months ago
2009
Springer
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆ + 1)2 synchronous communication rounds,...
ICCS
2003
Springer
15 years 3 months ago
2003
Springer
We propose an anytime algorithm to compute successively better approximations of the optimum of Minimum Vertex Guard. Though the presentation is focused on polygons, the work may b...
ALENEX
2004
14 years 11 months ago
2004
d Abstract) Faisal N. Abu-Khzam , Rebecca L. Collins , Michael R. Fellows , Michael A. Langston , W. Henry Suters and Chris T. Symons
ESA
2006
Springer
15 years 1 months ago
2006
Springer