158 search results - page 2 / 32 » Evolutionary algorithms and the Vertex Cover problem |
CEC
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract—Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different opt...
117
click to vote
PODC
2009
ACM
15 years 10 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
COR
2006
14 years 10 months ago
2006
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
132
click to vote
ACID
2006
14 years 11 months ago
2006
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...