166 search results - page 4 / 34 » Fixed-parameter evolutionary algorithms and the vertex cover... |
COR
2006
13 years 6 months ago
2006
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
CEC
2007
IEEE
14 years 18 days 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...
GECCO
2007
Springer
14 years 13 days ago
2007
Springer
ACID
2006
13 years 7 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...
COCOON
2004
Springer
13 years 11 months ago
2004
Springer
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...