Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs

We pursue a study of the Generalized Demand Matching problem, a common generalization of the $b$-Matching and Knapsack problems. Here, we are given a graph with vertex capacities, edge profits, and asymmetric demands on the edges. The goal is to find a maximum-profit subset of edges so the demands of chosen edges do not violate vertex capacities. This problem is APX-hard and constant-factor approximations are known. Our results fall into two categories. First, using iterated relaxation and various filtering strategies, we show with an efficient rounding algorithm if an additional matroid structure $\mathcal M$ is given and we further only allow sets $F \subseteq E$ that are independent in $\mathcal M$, the natural LP relaxation has an integrality gap of at most $\frac{25}{3} \approx 8.333$. This can be improved in various special cases, for example we improve over the 15-approximation for the previously-studied Coupled Placement problem [Korupolu et al. 2014] by giving a $7$-approximation. Using similar techniques, we show the problem of computing a minimum-cost base in $\mathcal M$ satisfying vertex capacities admits a $(1,3)$-bicriteria approximation. This improves over the previous $(1,4)$-approximation in the special case that $\mathcal M$ is the graphic matroid over the given graph [Fukanaga and Nagamochi, 2009]. Second, we show Demand Matching admits a polynomial-time approximation scheme in graphs that exclude a fixed minor. If all demands are polynomially-bounded integers, this is somewhat easy using dynamic programming in bounded-treewidth graphs. Our main technical contribution is a sparsification lemma allowing us to scale the demands to be used in a more intricate dynamic programming algorithm, followed by randomized rounding to filter our scaled-demand solution to a feasible solution.

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

[2]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[3]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[4]  Rajmohan Rajaraman,et al.  Coupled and k-Sided Placements: Generalizing Generalized Assignment , 2014, IPCO.

[5]  Ken-ichi Kawarabayashi,et al.  Algorithmic graph minor theory: Decomposition, approximation, and coloring , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[6]  Takuro Fukunaga,et al.  Network design with weighted degree constraints , 2010, Discret. Optim..

[7]  Harald Niederreiter,et al.  Probability and computing: randomized algorithms and probabilistic analysis , 2006, Math. Comput..

[8]  Morteza Zadimoghaddam,et al.  Spanning trees with minimum weighted degrees , 2007, Inf. Process. Lett..

[9]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

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

[11]  Maw-Sheng Chern,et al.  A Note on Approximation Schemes for Multidimensional Knapsack Problems , 1984, Math. Oper. Res..

[12]  Fabrizio Grandoni,et al.  A Mazing 2+∊ Approximation for Unsplittable Flow on a Path , 2014, SODA.

[13]  Georgii Gens,et al.  Complexity of approximation algorithms for combinatorial problems: a survey , 1980, SIGA.

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

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

[16]  Jonas Holmerin,et al.  Clique Is Hard to Approximate within n1-o(1) , 2000, ICALP.

[17]  Yuval Rabani,et al.  An improved approximation algorithm for resource allocation , 2011, TALG.