Approximation algorithms for the partition vertex cover problem

We consider a natural generalization of the Partial Vertex Cover problem. Here an instance consists of a graph G = (V,E), a cost function c: V → ℤ + , a partition P 1, …, P r of the edge set E, and a parameter k i for each partition P i . The goal is to find a minimum cost set of vertices which cover at least k i edges from the partition P i . We call this the Partition-VC problem. In this paper, we give matching upper and lower bound on the approximability of this problem. Our algorithm is based on a novel LP relaxation for this problem. This LP relaxation is obtained by adding knapsack cover inequalities to a natural LP relaxation of the problem. We show that this LP has integrality gap of O(logr), where r is the number of sets in the partition of the edge set. We also extend our result to more general settings.

[1]  Julián Mestre,et al.  A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses , 2005, Algorithmica.

[2]  Naveen Garg,et al.  Saving an epsilon: a 2-approximation for the k-MST problem in graphs , 2005, STOC '05.

[3]  David B. Shmoys,et al.  Primal-dual schema for capacitated covering problems , 2008, Math. Program..

[4]  Rajiv Gandhi,et al.  Approximation algorithms for partial covering problems , 2004, J. Algorithms.

[5]  Reuven Bar-Yehuda,et al.  Using homogenous weights for approximating the partial cover problem , 2001, SODA '99.

[6]  Samir Khuller,et al.  Algorithms for facility location problems with outliers , 2001, SODA '01.

[7]  Robert D. Carr,et al.  Strengthening integrality gaps for capacitated network design and covering problems , 2000, SODA '00.

[8]  Dror Rawitz,et al.  Approximation of Partial Capacitated Vertex Cover , 2007, SIAM J. Discret. Math..

[9]  J. Vondrák,et al.  Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes , 2014 .

[10]  Ke Chen,et al.  A constant factor approximation algorithm for k-median clustering with outliers , 2008, SODA '08.

[11]  Nader H. Bshouty,et al.  Massaging a Linear Programming Solution to Give a 2-Approximation for a Generalization of the Vertex Cover Problem , 1998, STACS.

[12]  Mohit Singh,et al.  Approximating the k-multicut problem , 2006, SODA '06.

[13]  David P. Williamson,et al.  The Design of Approximation Algorithms , 2011 .

[14]  Petr Slavík.  Improved Performance of the Greedy Algorithm for Partial Cover , 1997, Inf. Process. Lett..

[15]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[16]  Chandra Chekuri,et al.  Submodular function maximization via the multilinear relaxation and contention resolution schemes , 2011, STOC '11.

[17]  Reuven Bar-Yehuda,et al.  A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem , 1981, J. Algorithms.

[18]  Jan Vondrák,et al.  Maximizing a Monotone Submodular Function Subject to a Matroid Constraint , 2011, SIAM J. Comput..

[19]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[20]  Michael Kearns,et al.  Computational complexity of machine learning , 1990, ACM distinguished dissertations.

[21]  Dorit S. Hochbaum,et al.  The t-Vertex Cover Problem: Extending the Half Integrality Framework with Budget Constraints , 1998, APPROX.