54 search results - page 1 / 11 » Minimum Vertex Cover in Rectangle Graphs |
ESA
2010
Springer
14 years 30 min 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...
APPROX
2008
Springer
14 years 27 days ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
COCOON
2004
Springer
14 years 4 months ago
2004
Springer
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...
ISAAC
2000
Springer
14 years 2 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...
GECCO
2007
Springer
14 years 5 months ago
2007
Springer