Approximation algorithms for partial covering problems

We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard covering problems. For example, in k-set cover, we wish to choose a minimum number of sets to cover at least k elements. For k-set cover, if each element occurs in at most f sets, then we derive a primal-dual f-approximation algorithm (thus implying a 2-approximation for k-vertex cover) in polynomial time. In addition to its simplicity, this algorithm has the advantage of being parallelizable. For instances where each set has cardinality at most three, we obtain an approximation of 4/3. We also present better-than-2-approximation algorithms for k-vertex cover on bounded degree graphs, and for vertex cover on expanders of bounded average degree. We obtain a polynomial-time approximation scheme for k-vertex cover on planar graphs, and for covering points in Rd by disks.

[1]  Kenneth L. Clarkson,et al.  A Modification of the Greedy Algorithm for Vertex Cover , 1983, Inf. Process. Lett..

[2]  Leslie E. Trotter,et al.  Vertex packings: Structural properties and algorithms , 1975, Math. Program..

[3]  Detlef Seese,et al.  Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.

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

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

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

[7]  Samir Khuller,et al.  A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers , 1994, J. Algorithms.

[8]  Shirley Dex,et al.  JR 旅客販売総合システム（マルス）における運用及び管理について , 1991 .

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

[10]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[11]  Reuven Bar-Yehuda,et al.  A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.

[12]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[13]  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.

[14]  Magnús M. Halldórsson,et al.  Approximating k-Set Cover and Complementary Graph Coloring , 1996, IPCO.

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

[16]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[17]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[18]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[19]  Dorit S. Hochbaum,et al.  Efficient bounds for the stable set, vertex cover and set packing problems , 1983, Discret. Appl. Math..

[20]  Eran Halperin,et al.  Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs , 2000, SODA '00.

[21]  Aravind Srinivasan,et al.  Improved Approximation Algorithms for the Partial Vertex Cover Problem , 2002, APPROX.

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

[23]  David P. Williamson,et al.  A general approximation technique for constrained forest problems , 1992, SODA '92.

[24]  Aravind Srinivasan,et al.  New approaches to covering and packing problems , 2001, SODA '01.

[25]  Lynn Jennifer Burroughs.  Approximation algorithms for covering problems , 1998 .

[26]  Rong-chii Duh,et al.  Approximation of k-set cover by semi-local optimization , 1997, STOC '97.

[27]  Wolfgang Maass,et al.  Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.

[28]  Jon M. Kleinberg,et al.  The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover , 1998, SIAM J. Discret. Math..

[29]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[30]  Magnns M Hallddrsson.  Approximating K-set Cover and Complementary Graph Coloring , .

[31]  Dorit S. Hochbaum,et al.  Approximation Algorithms for the Set Covering and Vertex Cover Problems , 1982, SIAM J. Comput..

[32]  Noga Alon,et al.  An Asymptotic Isoperimetric Inequality , 1998 .

[33]  Randeep Bhatia,et al.  Book review: Approximation Algorithms for NP-hard Problems. Edited by Dorit S. Hochbaum (PWS, 1997) , 1998, SIGA.

[34]  H. Bodlaender.  Classes of graphs with bounded tree-width , 1986 .

[35]  Bar-YehudaReuven.  Using Homogeneous Weights for Approximating the Partial Cover Problem , 2001 .

[36]  Aravind Srinivasan,et al.  Distributions on level-sets with applications to approximation algorithms , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[37]  Gang Yu,et al.  A Modified Greedy Heuristic for the Set Covering Problem with Improved Worst Case Bound , 1993, Inf. Process. Lett..

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