Algorithms to Approximate Column-sparse Packing Problems

Column-sparse packing problems arise in several contexts in both deterministic and stochastic discrete optimization. We present two unifying ideas, (non-uniform) attenuation and multiple-chance algorithms, to obtain improved approximation algorithms for some well-known families of such problems. As three main examples, we attain the integrality gap, up to lower-order terms, for known LP relaxations for k-column-sparse packing integer programs (Bansal et al., Theory of Computing, 2012) and stochastic k-set packing (Bansal et al., Algorithmica, 2012), and go “half the remaining distance” to optimal for a major integrality-gap conjecture of Füredi, Kahn, and Seymour on hypergraph matching (Combinatorica, 1993).

[1]  Marek Adamczyk,et al.  Random Order Contention Resolution Schemes , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[2]  Nikhil Bansal,et al.  A logarithmic approximation for unsplittable flow on line graphs , 2014, TALG.

[3]  Mihalis Yannakakis,et al.  Primal-dual approximation algorithms for integral flow and multicut in trees , 1997, Algorithmica.

[4]  Fabrizio Grandoni,et al.  Improved Approximation Algorithms for Stochastic Matching , 2015, ESA.

[5]  Joseph Naor,et al.  A Unified Continuous Greedy Algorithm for Submodular Maximization , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[6]  Ojas Parekh,et al.  Generalized Hypergraph Matching via Iterated Packing and Local Ratio , 2014, WAOA.

[7]  Aravind Srinivasan,et al.  Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts , 2017, Algorithmica.

[8]  Marek Adamczyk.  Non-negative submodular stochastic probing via stochastic contention resolution schemes , 2015, ArXiv.

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

[10]  Joel H. Spencer,et al.  Deterministic Discrepancy Minimization , 2012, Algorithmica.

[11]  Anupam Gupta,et al.  Algorithms and Adaptivity Gaps for Stochastic Probing , 2016, SODA.

[12]  Aravind Srinivasan,et al.  Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems , 2000, Math. Oper. Res..

[13]  Niv Buchbinder,et al.  Constrained Submodular Maximization via a Non-symmetric Technique , 2016, Math. Oper. Res..

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

[15]  Vojtech Rödl,et al.  On a Packing and Covering Problem , 1985, Eur. J. Comb..

[16]  Khaled M. Elbassioni,et al.  Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees , 2012, FSTTCS.

[17]  Petr Kolman,et al.  A note on the greedy algorithm for the unsplittable flow problem , 2003, Inf. Process. Lett..

[18]  Nikhil Bansal,et al.  Improved Algorithmic Bounds for Discrepancy of Sparse Set Systems , 2016, ArXiv.

[19]  Aravind Srinivasan,et al.  Solving Packing Integer Programs via Randomized Rounding with Alterations , 2012, Theory Comput..

[20]  Nikhil Bansal,et al.  Constructive Algorithms for Discrepancy Minimization , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[21]  Anupam Gupta,et al.  Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions , 2016, SODA.

[22]  David Zuckerman,et al.  Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .

[23]  Aravind Srinivasan,et al.  New algorithmic aspects of the Local Lemma with applications to routing and partitioning , 1999, SODA '99.

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

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

[26]  Huy L. Nguyen,et al.  Constrained Submodular Maximization: Beyond 1/e , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

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

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

[29]  C. Nash-Williams.  Decomposition of Finite Graphs Into Forests , 1964 .

[30]  Jan Vondrák,et al.  On Multiplicative Weight Updates for Concave and Submodular Function Maximization , 2015, ITCS.

[31]  János Komlós,et al.  A Note on Ramsey Numbers , 1980, J. Comb. Theory, Ser. A.

[32]  Shachar Lovett,et al.  Constructive Discrepancy Minimization by Walking on the Edges , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[33]  Yossi Azar,et al.  Combinatorial Algorithms for the Unsplittable Flow Problem , 2005, Algorithmica.

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

[35]  Jan Vondrák,et al.  Adaptivity and approximation for stochastic packing problems , 2005, SODA '05.

[36]  Jan Vondrák,et al.  Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[37]  Chandra Chekuri,et al.  Submodular function maximization via the multilinear relaxation and contention resolution schemes , 2011, STOC '11.

[38]  Jan Vondrák,et al.  Submodular maximization by simulated annealing , 2010, SODA '11.

[39]  Maxim Sviridenko,et al.  Submodular Stochastic Probing on Matroids , 2013, Math. Oper. Res..

[40]  Joseph Naor,et al.  Submodular Maximization with Cardinality Constraints , 2014, SODA.

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

[42]  Aravind Srinivasan,et al.  Improved Bounds in Stochastic Matching and Optimization , 2015, APPROX-RANDOM.

[43]  Yuk Hei Chan,et al.  On linear and semidefinite programming relaxations for hypergraph matching , 2010, SODA '10.

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

[45]  Ojas Parekh.  Iterative Packing for Demand and Hypergraph Matching , 2011, IPCO.

[46]  Atri Rudra,et al.  When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings , 2010, Algorithmica.

[47]  Andrew U. Frank,et al.  How to orient the edges of a graph? in Combinatorics , 1976 .

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

[49]  Avi Levy,et al.  Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method , 2016, IPCO.

[50]  Chandra Chekuri,et al.  Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs , 2009, APPROX-RANDOM.

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

[52]  Jian Li,et al.  Stochastic combinatorial optimization via poisson approximation , 2012, STOC '13.

[53]  Robert D. Carr,et al.  Randomized metarounding , 2002, Random Struct. Algorithms.

[54]  Zoltán Füredi,et al.  On the fractional matching polytope of a hypergraph , 1993, Comb..

[55]  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..

[56]  G. Szekeres,et al.  An inequality for the chromatic number of a graph , 1968 .

[57]  Aravind Srinivasan,et al.  Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds , 1997, SIAM J. Comput..

[58]  Jon M. Kleinberg,et al.  Approximation algorithms for disjoint paths problems , 1996 .

[59]  Random Walks in Polytopes and Negative Dependence , 2017, ITCS.

[60]  Klaus Jansen,et al.  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques , 2006, Lecture Notes in Computer Science.

[61]  Aravind Srinivasan,et al.  Improving the discrepancy bound for sparse matrices: better approximations for sparse lattice approximation problems , 1997, SODA '97.

[62]  Chandra Chekuri,et al.  Multicommodity demand flow in a tree and packing integer programs , 2007, TALG.

[63]  Christian Scheideler,et al.  Improved bounds for the unsplittable flow problem , 2002, SODA '02.

[64]  Nikhil Bansal,et al.  An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[65]  Baruch Schieber,et al.  A quasi-PTAS for unsplittable flow on line graphs , 2006, STOC '06.

[66]  Jan Vondrák,et al.  Approximating the stochastic knapsack problem: the benefit of adaptivity , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[67]  Maurice Queyranne,et al.  A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory , 1982, Networks.

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

[69]  Sanjeev Khanna,et al.  An O(sqrt(n)) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow , 2006, Theory Comput..

[70]  Thomas Rothvoß,et al.  Constructive Discrepancy Minimization for Convex Sets , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[71]  Aravind Srinivasan,et al.  Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

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

[73]  Amit Kumar,et al.  Approximation Algorithms for the Unsplittable Flow Problem , 2002, Algorithmica.

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

[75]  Aravind Srinivasan,et al.  Chernoff-Hoeffding bounds for applications with limited independence , 1995, SODA '93.