Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes

Abstract

We consider the problem of maximizing a non-negative submodular set function $f:2^N\to {\mathbb{R}}_{+}$ over a ground set $N$ subject to a variety of packing type constraints including (multiple) matroid constraints, knapsack constraints, and their intersections. In this paper we develop a general framework that allows us to derive a number of new results, in particular when $f$ may be a non-monotone function. Our algorithms are based on (approximately) maximizing the multilinear extension $F$ of $f$ over a polytope $P$ that represents the constraints, and then effectively rounding the fractional solution. Although this approach has been used quite successfully, it has been limited in some important ways. We overcome these limitations as follows. First, we give constant factor approximation algorithms to maximize $F$ over a down-closed polytope $P$ described by an efficient separation oracle. Previously this was known only for monotone functions. For non-monotone functions, a constant factor was known only when the polytope was either the intersection of a fixed number of knapsack constraints or a matroid polytope. Second, we show that contention resolution schemes are an effective way to round a fractional solution, even when $f$ is non-monotone. In particular, contention resolution schemes for different polytopes can be combined to handle the intersection of different constraints. Via LP duality we show that a contention resolution scheme for a constraint is related to the correlation gap of weighted rank functions of the constraint. This leads to an optimal contention resolution scheme for the matroid polytope. Our results provide a broadly applicable framework for maximizing linear and submodular functions subject to independence constraints. We give several illustrative examples. Contention resolution schemes may find other applications.

Revision of previous version; extended abstract appeared at STOC 2011

References in corpus (3)

• Mechanism Design via Correlation Gap
• A note on concentration of submodular functions
• Maximizing Non-monotone Submodular Set Functions Subject to Different Constraints: Combined Algorithms

Cited by in corpus (20)

• Determinantal point processes for machine learning
• Online Continuous Submodular Maximization
• Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions
• Gradient Methods for Submodular Maximization
• Submodular Optimization under Noise
• Multivariate Submodular Optimization
• Matroid and Knapsack Center Problems
• Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity
• Algorithmic Meta-Theorems for Monotone Submodular Maximization
• Approximation Algorithms for the Connected Sensor Cover Problem
• Efficient Submodular Function Maximization under Linear Packing Constraints
• Approximation Schemes for Binary Quadratic Programming Problems with Low cp-Rank Decompositions
• Bayesian Budget Feasibility with Posted Pricing
• Approximation Algorithms for Maximum Independent Set of Pseudo-Disks
• Maximizing submodular functions using probabilistic graphical models
• Maximizing Non-monotone Submodular Set Functions Subject to Different Constraints: Combined Algorithms
• Submodular Stochastic Probing with Prices
• Approximation Algorithms for Edge Partitioned Vertex Cover Problems
• Geometric Packing under Non-uniform Constraints
• FPT Approximation Schemes for Maximizing Submodular Functions