A-priori upper bounds for the set covering problem

In this paper we present a new bound obtained with the probabilistic method for the solution of the set covering problem with unit costs. The bound is valid for problems of fixed dimension, thus extending previous similar asymptotic results, and it depends only on the number of rows of the coefficient matrix and the row densities. We also consider the particular case of matrices that are almost block decomposable, and show how the bound may improve according to the particular decomposition adopted. Such final result may provide interesting indications for comparing different matrix decomposition strategies.

[1]  Luca Trevisan,et al.  A PCP characterization of NP with optimal amortized query complexity , 2000, STOC '00.

[2]  Maxim Sviridenko,et al.  New and Improved Bounds for the Minimum Set Cover Problem , 2012, APPROX-RANDOM.

[3]  Michael Krivelevich,et al.  Approximate Set Covering in Uniform Hypergraphs , 1997, J. Algorithms.

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

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Ramasamy Panneerselvam,et al.  Literature review of covering problem in operations management , 2010 .

[7]  Guanghui Lan,et al.  An effective and simple heuristic for the set covering problem , 2007, Eur. J. Oper. Res..

[8]  Seymour M. Kwerel.  Bounds on the probability of the union and intersection of m events , 1975, Advances in Applied Probability.

[9]  Liang Chen,et al.  Set Covering Problems in Role-Based Access Control , 2009, ESORICS.

[10]  Vittorio Maniezzo,et al.  A set covering based matheuristic for a real-world city logistics problem , 2015, Int. Trans. Oper. Res..

[11]  Y. Crama,et al.  Cause-effect relationships and partially defined Boolean functions , 1988 .

[12]  Chris H. Q. Ding,et al.  Binary Matrix Factorization with Applications , 2007, Seventh IEEE International Conference on Data Mining (ICDM 2007).

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

[14]  Laura Grigori,et al.  A partitioning algorithm for block-diagonal matrices with overlap , 2008, Parallel Comput..

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

[16]  Toshihide Ibaraki,et al.  Logical Analysis of Data , 2005 .

[17]  W. Art Chaovalitwongse,et al.  Set covering approach for reconstruction of sibling relationships , 2007, Optim. Methods Softw..

[18]  T. Grossman,et al.  Computational Experience with Approximation Algorithms for the Set Covering Problem , 1994 .

[19]  David Avis,et al.  SET COVERING PROBLEMS , 1980 .

[20]  Nicos Christofides,et al.  Note—A Computational Survey of Methods for the Set Covering Problem , 1975 .

[21]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[22]  N. Alon,et al.  The Probabilistic Method: Alon/Probabilistic , 2008 .

[23]  Subhash Khot,et al.  Hardness of Minimizing and Learning DNF Expressions , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[24]  Asaf Levin,et al.  Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search , 2006, SIAM J. Discret. Math..

[25]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[26]  Tao Li,et al.  A general model for clustering binary data , 2005, KDD '05.

[27]  Enrico Bertolazzi,et al.  Fast matrix decomposition in F2 , 2012, J. Comput. Appl. Math..

[28]  Carlos Eduardo Ferreira,et al.  Decomposing Matrices into Blocks , 1998, SIAM J. Optim..

[29]  Valentina Cacchiani,et al.  A set-covering based heuristic algorithm for the periodic vehicle routing problem , 2014, Discret. Appl. Math..

[30]  Edmund K. Burke,et al.  New approaches to nurse rostering benchmark instances , 2014, Eur. J. Oper. Res..

[31]  Toshihide Ibaraki,et al.  CAUSE-EFFECT RELATIONSHIPS AND PARTIALLY DEFINED , 1988 .

[32]  Matteo Fischetti,et al.  Algorithms for the Set Covering Problem , 2000, Ann. Oper. Res..

[33]  Carlo Vercellis,et al.  A probabilistic analysis of the set covering problem , 1984, Ann. Oper. Res..

[34]  D. Crothers,et al.  Comment on 'Semiclassical approximation of the radial equation with two-dimensional potentials' , 1976 .

[35]  Michael Okun,et al.  On approximation of the vertex cover problem in hypergraphs , 2005, Discret. Optim..

[36]  András Prékopa,et al.  Bounding the probability of the union of events by aggregation and disaggregation in linear programs , 2005, Discret. Appl. Math..

[37]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1993, STOC.

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

[39]  M. Mézard,et al.  Spin Glass Theory and Beyond , 1987 .

[40]  J. Fontanari.  A STATISTICAL MECHANICS ANALYSIS OF THE SET COVERING PROBLEM , 1996 .