An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint
From MaRDI portal
Publication:2118096
DOI10.1007/S10107-020-01570-6zbMATH Open1489.90149arXiv1905.08658OpenAlexW3091384923MaRDI QIDQ2118096FDOQ2118096
Simon Bruggmann, Rico Zenklusen
Publication date: 22 March 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Abstract: Relaxation and rounding approaches became a standard and extremely versatile tool for constrained submodular function maximization. One of the most common rounding techniques in this context are contention resolution schemes. Such schemes round a fractional point by first rounding each coordinate independently, and then dropping some elements to reach a feasible set. Also the second step, where elements are dropped, is typically randomized. This leads to an additional source of randomization within the procedure, which can complicate the analysis. We suggest a different, polyhedral viewpoint to design contention resolution schemes, which avoids to deal explicitly with the randomization in the second step. This is achieved by focusing on the marginals of a dropping procedure. Apart from avoiding one source of randomization, our viewpoint allows for employing polyhedral techniques. Both can significantly simplify the construction and analysis of contention resolution schemes. We show how, through our framework, one can obtain an optimal monotone contention resolution scheme for bipartite matchings. So far, only very few results are known about optimality of monotone contention resolution schemes. Our contention resolution scheme for the bipartite case also improves the lower bound on the correlation gap for bipartite matchings. Furthermore, we derive a monotone contention resolution scheme for matchings that significantly improves over the previously best one. At the same time, our scheme implies that the currently best lower bound on the correlation gap for matchings is not tight. Our results lead to improved approximation factors for various constrained submodular function maximization problems over a combination of matching constraints with further constraints.
Full work available at URL: https://arxiv.org/abs/1905.08658
Recommendations
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- Online contention resolution schemes
- Online contention resolution schemes with applications to Bayesian selection problems
- Multi-budgeted matchings and matroid intersection via dependent rounding
Cites Work
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Title not available (Why is that?)
- Asymptotic Statistics
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Title not available (Why is that?)
- Combinatorial auctions with decreasing marginal utilities
- Improved Approximations for k-Exchange Systems
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- An analysis of approximations for maximizing submodular set functions—I
- Title not available (Why is that?)
- Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
- Online Contention Resolution Schemes
- A Stochastic Probing Problem with Applications
- Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
- Non-monotone submodular maximization under matroid and knapsack constraints
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- Maximizing Non-monotone Submodular Functions
- Title not available (Why is that?)
- A note on maximizing a submodular set function subject to a knapsack constraint
- Pipage rounding: a new method of constructing algorithms with proven performance guarantee
- Price of correlations in stochastic optimization
- Optimal approximation for the submodular welfare problem in the value oracle model
- Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints
- Title not available (Why is that?)
- Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
- Symmetry and approximability of submodular maximization problems
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- Deterministic Algorithms for Submodular Maximization Problems
- A Unified Continuous Greedy Algorithm for Submodular Maximization
- Combinatorial optimization. Theory and algorithms
- How to Sell Hyperedges: The Hypermatching Assignment Problem
- Submodular Maximization Through the Lens of Linear Programming
- A \(\frac{(k+3)}{2}\)-approximation algorithm for monotone submodular \(k\)-set packing and general \(k\)-exchange systems
- Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm
- Constrained Submodular Maximization via a Nonsymmetric Technique
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118096)
