158 search results - page 8 / 32 » Evolutionary algorithms and the Vertex Cover problem |
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
KI
2007
Springer
15 years 4 months ago
2007
Springer
We introduce a novel stochastic local search algorithm for the vertex cover problem. Compared to current exhaustive search techniques, our algorithm achieves excellent performance ...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
COCOA
2008
Springer
14 years 11 months ago
2008
Springer
Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial...
126
click to vote
ESA
2010
Springer
14 years 11 months ago
2010
Springer
We consider the Minimum Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rect...