188 search results - page 5 / 38 » Evolutionary Algorithms for Vertex Cover |
100
click to vote
FAW
2008
Springer
15 years 1 months ago
2008
Springer
constraint bipartite vertex cover is a graph-theoretical formalization of the spare allocation problem for reconfigurable arrays. We report on an implementation of a parameterized ...
PODC
2005
ACM
15 years 5 months ago
2005
ACM
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...
SIAMCOMP
2008
14 years 11 months ago
2008
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
ICCS
2003
Springer
15 years 4 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...
AICCSA
2005
IEEE
15 years 5 months ago
2005
IEEE