188 search results - page 7 / 38 » Evolutionary Algorithms for Vertex Cover |
WEA
2005
Springer
15 years 5 months ago
2005
Springer
The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, e...
STOC
2007
ACM
15 years 12 months ago
2007
ACM
We study linear programming relaxations of Vertex Cover and Max Cut arising from repeated applications of the "lift-and-project" method of Lovasz and Schrijver starting ...
115
click to vote
ISAAC
2000
Springer
15 years 3 months ago
2000
Springer
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
STOC
2010
ACM
15 years 4 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...
75
Voted
STOC
2002
ACM
15 years 12 months ago
2002
ACM
The Minimum Vertex Cover problem is the problem of, given a graph, finding a smallest set of vertices that touches all edges. We show that it is NP-hard to approximate this proble...