188 search results - page 8 / 38 » Evolutionary Algorithms for Vertex Cover |
101
click to vote
ICALP
2001
Springer
15 years 4 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
142
Voted
ESA
2010
Springer
15 years 21 days 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...
STOC
2010
ACM
15 years 9 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
104
click to vote
KI
2007
Springer
15 years 5 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 ...
103
Voted
ADHOCNOW
2008
Springer
15 years 6 months ago
2008
Springer
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...