From valid inequalities to heuristics: a unified view of primal-dual approximation algorithms in covering problems

In recent years approximation algorithms based on primal-dual methods have been successfully applied to a broad class of discrete optimization problems. In this paper, we propose a generic primal-dual framework to design and analyze approximation algorithms for integer programming problems of the covering type that uses valid inequalities in its design. The worst-case bound of the proposed algorithm is related to a fundamental relationship (called strength) between the set of valid inequalities and the set of minimal solutions to the covering problems. In this way, we can construct an approximation algorithm simply by constructing the required valid inequalities. We apply the proposed algorithm to several problems, such as covering problems related to totally balanced matrices, cyclic scheduling, vertex cover, general set covering, intersections of polymatroids, and several network design problems attaining (in most cases) the best worst-case bound known in the literature.

[1]  D. R. Fulkerson,et al.  Blocking and anti-blocking pairs of polyhedra , 1971, Math. Program..

[2]  S. Chopra.  On the spanning tree polyhedron , 1989 .

[3]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.

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

[5]  Andrew V. Goldberg,et al.  Improved approximation algorithms for network design problems , 1994, SODA '94.

[6]  T. Magnanti,et al.  Modeling and heuristic worst-case performance analysis of the two-level network design problem , 1994 .

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

[8]  L. Shapley.  Cores of convex games , 1971 .

[9]  P. Erd Os,et al.  On the maximal number of disjoint circuits of a graph , 2022, Publicationes Mathematicae Debrecen.

[10]  Michel X. Goemans,et al.  Worst-case comparison of valid inequalities for the TSP , 1995, Math. Program..

[11]  Nicos Christofides.  Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

[12]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

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

[14]  Alexander Schrijver,et al.  Polyhedral proof methods in combinatorial optimization , 1986, Discret. Appl. Math..

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

[16]  James B. Orlin,et al.  Cyclic Scheduling via Integer Programs with Circular Ones , 1980, Oper. Res..

[17]  Dorit S. Hochbaum,et al.  A fast approximation algorithm for the multicovering problem , 1986, Discret. Appl. Math..

[18]  Dimitris Bertsimas,et al.  Constructing approximation algorithms via linear programming relaxations: primal dual and randomized rounding techniques , 1996 .

[19]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.

[20]  R. Vohra,et al.  Linear programming relaxations, approximation algorithms and randomization: A unified view of covering problems , 1994 .

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

[22]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[23]  David P. Williamson.  On the design of approximation algorithms for a class of graph problems , 1993 .

[24]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

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

[26]  R. Ravi,et al.  When cycles collapse: A general approximation technique for constrained two-connectivity problems , 1992, IPCO.

[27]  Richard M. Karp,et al.  On Linear Characterizations of Combinatorial Optimization Problems , 1982, SIAM J. Comput..

[28]  Gregory Dobson,et al.  Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data , 1982, Math. Oper. Res..

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