Solving Packing Integer Programs via Randomized Rounding with Alterations

We give new approximation algorithms for packing integer programs (PIPs) by employing the method of randomized rounding combined with alterations. Our first result is a simpler approximation algorithm for general PIPs which matches the best known bounds, and which admits an efficient parallel implementation. We also extend these results to a multi-criteria version of PIPs. Our second result is for the class of packing integer programs (PIPs) that are column sparse, i. e., where there is a specified upper bound k on the number of constraints that each variable appears in. We give an (ek+ o(k))-approximation algorithm for k-column sparse PIPs, improving over previously known O(k 2 )-approximation ratios. We also generalize our result to the case of maximizing non-negative monotone submodular functions over k-column sparse packing constraints, and obtain an e 2k

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

[2]  Deeparnab Chakrabarty,et al.  Approximability of Sparse Integer Programs , 2009, Algorithmica.

[3]  Uriel Feige,et al.  On maximizing welfare when utility functions are subadditive , 2006, STOC '06.

[4]  Esther M. Arkin,et al.  On Local Search for Weighted k-Set Packing , 1998, Math. Oper. Res..

[5]  Esther M. Arkin,et al.  On Local Search for Weighted k-Set Packing , 1997, Math. Oper. Res..

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

[7]  Piotr Berman,et al.  A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs , 2000, Nord. J. Comput..

[8]  Hadas Shachnai,et al.  Maximizing submodular set functions subject to multiple linear constraints , 2009, SODA.

[9]  Aravind Srinivasan,et al.  On k-Column Sparse Packing Programs , 2010, IPCO.

[10]  Clifford Stein,et al.  Approximating disjoint-path problems using packing integer programs , 2004, Math. Program..

[11]  Uriel Feige On Maximizing Welfare When Utility Functions Are Subadditive , 2009, SIAM J. Comput..

[12]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[13]  Barun Chandra,et al.  Greedy local improvement and weighted set packing approximation , 2001, SODA '99.

[14]  Jan Vondrák,et al.  Maximizing a Monotone Submodular Function Subject to a Matroid Constraint , 2011, SIAM J. Comput..

[15]  David Zuckerman Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number , 2007, Theory Comput..

[16]  Funda Ergün,et al.  QoS routing with performance-dependent costs , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[17]  Subhash Khot,et al.  Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

[18]  Noam Nisan,et al.  A parallel approximation algorithm for positive linear programming , 1993, STOC.

[19]  Justin Ward A (k+3)/2-approximation algorithm for monotone submodular k-set packing and general k-exchange systems , 2012, STACS.

[20]  Joseph Naor,et al.  Improved Approximations for k-Exchange Systems - (Extended Abstract) , 2011, ESA.

[21]  Alexander Schrijver,et al.  On the Size of Systems of Sets Every t of Which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems , 1989, SIAM J. Discret. Math..

[22]  R. Ravi,et al.  A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees , 2000, STOC '00.

[23]  Subhash Khot,et al.  On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[24]  József Beck,et al.  "Integer-making" theorems , 1981, Discret. Appl. Math..

[25]  Éva Tardos,et al.  An approximation algorithm for the generalized assignment problem , 1993, Math. Program..

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

[27]  Subhash Khot,et al.  Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs , 2009, Computational Complexity Conference.

[28]  Oded Schwartz,et al.  On the complexity of approximating k-set packing , 2006, computational complexity.

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

[30]  Jan Vondrák,et al.  Optimal approximation for the submodular welfare problem in the value oracle model , 2008, STOC.

[31]  Aravind Srinivasan,et al.  Improved Approximation Guarantees for Packing and Covering Integer Programs , 1999, SIAM J. Comput..

[32]  Adrian Vetta,et al.  The Demand Matching Problem , 2002, IPCO.

[33]  Adrian Vetta,et al.  The Demand-Matching Problem , 2007, Math. Oper. Res..

[34]  Vahab S. Mirrokni,et al.  Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints , 2009, SIAM J. Discret. Math..

[35]  Prabhakar Raghavan,et al.  Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).