2 search results - page 1 / 1 » Primal-dual based distributed algorithms for vertex cover wi... |
SIAMCOMP
2008
13 years 5 months ago
2008
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
PODC
2005
ACM
13 years 10 months ago
2005
ACM
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...