Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique

The notion of penalty has been introduced into many combinatorial optimization models. In this paper, we consider the submodular vertex cover problems with linear and submodular penalties, which are two variants of the submodular vertex cover problem where not all the edges are required to be covered by a vertex cover, and the uncovered edges are penalized. The problem is to determine a vertex subset to cover some edges and penalize the uncovered edges such that the total cost including covering and penalty is minimized. To overcome the difficulty of implementing the primal-dual framework directly, we relax the two dual programs to slightly weaker versions. We then present two primal-dual approximation algorithms with approximation ratios of 2 and 4, respectively.

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

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

[3]  Dror Rawitz,et al.  On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique , 2001, RANDOM-APPROX.

[4]  Alexander Schrijver,et al.  A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory B.

[5]  Yu Li,et al.  Improved Approximation Algorithms for the Facility Location Problems with Linear/Submodular Penalties , 2014, Algorithmica.

[6]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[7]  Dror Rawitz,et al.  An Extension of the Nemhauser--Trotter Theorem to Generalized Vertex Cover with Applications , 2010, SIAM J. Discret. Math..

[8]  David P. Williamson,et al.  A note on the prize collecting traveling salesman problem , 1993, Math. Program..

[9]  Dachuan Xu,et al.  A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties , 2011, Algorithmica.

[10]  Yu Li,et al.  Improved Approximation Algorithms for the Facility Location Problems with Linear/submodular Penalty , 2013, COCOON.

[11]  Samir Khuller,et al.  Capacitated vertex covering , 2003, J. Algorithms.

[12]  László Lovász,et al.  Submodular functions and convexity , 1982, ISMP.

[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]  Dorit S. Hochbaum,et al.  Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations , 2002, Eur. J. Oper. Res..

[15]  Satoru Iwata,et al.  A combinatorial strongly polynomial algorithm for minimizing submodular functions , 2001, JACM.

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

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

[18]  Jack Edmonds,et al.  Submodular Functions, Matroids, and Certain Polyhedra , 2001, Combinatorial Optimization.

[19]  Satoru Iwata,et al.  A push-relabel framework for submodular function minimization and applications to parametric optimization , 2003, Discret. Appl. Math..

[20]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

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

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

[23]  Satoru Iwata,et al.  Submodular Function Minimization under Covering Constraints , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[24]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[25]  George Karakostas,et al.  A better approximation ratio for the vertex cover problem , 2005, TALG.

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

[27]  Satoru Fujishige,et al.  Submodular functions and optimization , 1991 .