One for the Price of Two: A Unified Approach for Approximating Covering Problems

We present a simple and unified approach for developing and analyzing approximation algorithms for covering problems. We illustrate this on approximation algorithms for the following problems: Vertex Cover, Set Cover, Feedback Vertex Set, Generalized Steiner Forest and related problems.

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

[2]  Reuven Bar-Yehuda,et al.  Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and Bayesian inference , 1994, SODA '94.

[3]  Toshihiro Fujito,et al.  A Unified Local Ratio Approximation of Node-Deletion Problems (Extended Abstract) , 1996, ESA.

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

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

[6]  Piotr Berman,et al.  Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs , 1995, ISAAC.

[7]  David P. Williamson,et al.  A primal-dual approximation algorithm for generalized steiner network problems , 1995, Comb..

[8]  David P. Williamson,et al.  A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs , 1998, Oper. Res. Lett..

[9]  David P. Williamson,et al.  Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.

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

[11]  D. Hochbaum.  Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems , 1996 .

[12]  Dan Geiger,et al.  Approximation Algorithms for the Loop Cutset Problem , 1994, UAI.

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

[14]  V. Paschos.  A survey of approximately optimal solutions to some covering and packing problems , 1997, CSUR.

[15]  Reuven Bar-Yehuda,et al.  Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference , 1998, SIAM J. Comput..

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

[17]  R. Ravi,et al.  When trees collide: an approximation algorithm for the generalized Steiner problem on networks , 1991, STOC '91.