Multi-budgeted matchings and matroid intersection via dependent rounding

Motivated by multi-budgeted optimization and other applications, we consider the problem of randomly rounding a fractional solution x in the (non-bipartite graph) matching and matroid intersection polytopes. We show that for any fixed Δ > 0, a given point x can be rounded to a random solution R such that E[1R] = (1 − Δ)x and any linear function of x satisfies dimension-free Chernoff-Hoeffding concentration bounds (the bounds depend on Δ and the expectation μ). We build on and adapt the swap rounding scheme in our recent work [9] to achieve this result. Our main contribution is a non-trivial martingale based analysis framework to prove the desired concentration bounds. In this paper we describe two applications. We give a randomized PTAS for matroid intersection and matchings with any fixed number of budget constraints. We also give a deterministic PTAS for the case of matchings. The concentration bounds also yield related results when the number of budget constraints is not fixed. As a second application we obtain an algorithm to compute in polynomial time an ∈-approximate Pareto-optimal set for the multi-objective variants of these problems, when the number of objectives is a fixed constant. We rely on a result of Papadimitriou and Yannakakis [26].

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

[2]  Francesco Maffioli,et al.  Random Pseudo-Polynomial Algorithms for Exact Matroid Problems , 1992, J. Algorithms.

[3]  Aravind Srinivasan,et al.  A new approximation technique for resource‐allocation problems , 2010, ICS.

[4]  Amin Saberi,et al.  An approximation algorithm for max-min fair allocation of indivisible goods , 2007, STOC '07.

[5]  Mohit Singh,et al.  Iterative Rounding for Multi-Objective Optimization Problems , 2009, ESA.

[6]  Torben Hagerup,et al.  A Guided Tour of Chernoff Bounds , 1990, Inf. Process. Lett..

[7]  Fabrizio Grandoni,et al.  Budgeted matching and budgeted matroid intersection via the gasoline puzzle , 2008, Math. Program..

[8]  Maxim Sviridenko,et al.  Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee , 2004, J. Comb. Optim..

[9]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[10]  Rajiv Gandhi,et al.  Dependent rounding and its applications to approximation algorithms , 2006, JACM.

[11]  Jan Vondrák,et al.  Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) , 2007, IPCO.

[12]  Aravind Srinivasan,et al.  A unified approach to scheduling on unrelated parallel machines , 2009, JACM.

[13]  Eugene L. Lawler,et al.  Matroid intersection algorithms , 1975, Math. Program..

[14]  Amin Saberi,et al.  An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem , 2010, SODA '10.

[15]  Aravind Srinivasan,et al.  Distributions on level-sets with applications to approximation algorithms , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[16]  Amin Saberi,et al.  An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem , 2010, SODA '10.

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

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

[19]  Benjamin Doerr Randomly Rounding Rationals with Cardinality Constraints and Derandomizations , 2007, STACS.

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

[21]  Mihalis Yannakakis,et al.  On the approximability of trade-offs and optimal access of Web sources , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[22]  Vijay V. Vazirani,et al.  Matching is as easy as matrix inversion , 1987, STOC.

[23]  Alan M. Frieze,et al.  A new rounding procedure for the assignment problem with applications to dense graph arrangement problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[24]  V. Nagarajan,et al.  MAXIMIZING NON-MONOTONE SUBMODULAR FUNCTIONS UNDER MATROID AND KNAPSACK CONSTRAINTS , 2007 .

[25]  Aravind Srinivasan,et al.  Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm , 2010, IPCO.

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

[27]  Jan Vondrák,et al.  Submodular Maximization over Multiple Matroids via Generalized Exchange Properties , 2009, Math. Oper. Res..

[28]  J. Edmonds Matroid Intersection , 2022 .

[29]  R. Ravi,et al.  The Constrained Minimum Spanning Tree Problem (Extended Abstract) , 1996, SWAT.

[30]  Manfred Broy,et al.  A Guided Tour , 2001 .

[31]  Fabrizio Grandoni,et al.  Approximation Schemes for Multi-Budgeted Independence Systems , 2010, ESA.