9572 search results - page 15 / 1915 » Cover Algorithms and Their Combination |
IPL
2010
13 years 2 months ago
2010
In this paper we initiate the study of a "dynamic" variant of the classical Vertex Cover problem, the Eternal Vertex Cover problem introduced by Klostermeyer and Mynhard...
ESA
2005
Springer
14 years 1 months ago
2005
Springer
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints th...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we consider both the maximization variant Max Rep and the minimization variant Min Rep of the famous Label Cover problem, for which, till now, the best approximation ...
FAW
2008
Springer
13 years 9 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 ...
EPS
1998
Springer
13 years 11 months ago
1998
Springer
This paper reports work investigating various evolutionary approaches to vertex cover (VC), a well-known NP-Hard optimization problem. Central to each of the algorithms is a novel ...