Primal-dual based distributed algorithms for vertex cover with semi-hard capacities


In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph <i>G=(V,E)</i>, non-negative vertex weights <i>wt<inf>v</inf></i> for all vertices <i>v &#8712; V</i>, and node-capacities <i>B<inf>v</inf> &#8805; 1</i> for all <i>v &#8712; V</i>. A feasible solution to a given… (More)
DOI: 10.1145/1073814.1073835


2 Figures and Tables