In this paper, we consider the minimum unweighted Vertex Cover problem with Hard Capacity constraints (VCHC) on multigraphs and hypergraphs. Given a graph, the objective of VCHC is to find a smallest multiset of vertices that cover all edges, under the constraints that each vertex can only cover a limited number of incident edges, and the number of available copies of each vertex is bounded. This problem generalizes the classical unweighted vertex cover problem. Here we restrict our attention to unweighted instances, since the weighted version of VCHC is as hard as the set cover problem, as shown by Chuzhoy and Naor (FOCS 2002). We obtain improved approximation algorithms for VCHC on multigraphs and hypergraphs. This problem has first been studied by Saha and Khuller (ICALP 2012). They proposed a 38-approximation for multigraphs, and a max {6f, 65}-approximation for hypergraphs, where f is the size of the largest hyperedge. In this paper, we significantly improve these approximation ratios to 1 + 2/ √ 3 < 2.155 and 2f respectively. In the case of multigraphs, our approximation ratio is very close to the longstanding bound of 2 for the classical vertex cover problem. Our algorithms consist of a two-step process, each based on rounding an appropriate linear program. In particular, for multigraphs, the analysis in the second step relies on identifying a matching structure within any extreme point solution. Furthermore, we consider the partial VCHC problem in which one only needs to cover all but edges. We propose a generic reduction from partial VCHC on f -hypergraphs to VCHC on (f + 1)-hypergraphs, with a small loss in the approximation factor. In particular, we present a (2f + 2)(1 + )-approximation algorithm for partial VCHC on f -hypergraphs.
For partial VC-HC, which aims at covering a given number of edges, Cheung et al REF provided a (1+ )(2f +2)-approximation, based on a reduction to (f + 1)-hypergraphs and their 2f -approximation for VC-HC presented in the same work.
Improved Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs
SODA
Mathematics Computer Science