SIAM Journal on Discrete Mathematics


Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints

Related Databases

Web of Science

You must be logged in with an active subscription to view this.

Article Data

History

Submitted: 17  February  2009
Accepted: 15 September 2009
Published online: 15 January 2010

Publication Data

ISSN (print): 0895-4801
ISSN (online): 1095-7146
CODEN: sjdmec

Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hypergraphs, certain constraint satisfaction problems, maximum entropy sampling, and maximum facility location problems. Unlike submodular minimization, submodular maximization is NP-hard. In this paper, we give the first constant-factor approximation algorithm for maximizing any nonnegative submodular function subject to multiple matroid or knapsack constraints. We emphasize that our results are for nonmonotone submodular functions. In particular, for any constant k, we present a $(\frac{1}{k+2+\frac{1}{k}+\epsilon})$-approximation for the submodular maximization problem under k matroid constraints, and a $(\frac{1}{5}-\epsilon)$-approximation algorithm for this problem subject to k knapsack constraints ($\epsilon>0$ is any constant). We improve the approximation guarantee of our algorithm to $\frac{1}{k+1+\frac{1}{k-1}+\epsilon}$ for $k\geq2$ partition matroid constraints. This idea also gives a $(\frac{1}{k+\epsilon})$-approximation for maximizing a monotone submodular function subject to $k\geq2$ partition matroids, which is an improvement over the previously best known guarantee of $\frac{1}{k+1}$.

Copyright © 2010 Society for Industrial and Applied Mathematics

Cited by

(2016) Maximizing Stochastic Monotone Submodular Functions. Management Science 62:8, 2374-2391. CrossRef
(2016) Towards Scalable Voltage Control in Smart Grid: A Submodular Optimization Approach. 2016 ACM/IEEE 7th International Conference on Cyber-Physical Systems (ICCPS), 1-10. CrossRef
2016. Max-Cut Under Graph Constraints. Integer Programming and Combinatorial Optimization, 50-62. CrossRef
(2015) Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets. ACM Transactions on Algorithms 12:10.1145/2846103, 1-21. CrossRef
(2015) Supermodular covering knapsack polytope. Discrete Optimization 18, 74-86. CrossRef
(2015) Optimal response to epidemics and cyber attacks in networks. Networks 66:10.1002/net.v66.2, 145-158. CrossRef
(2015) Scalable and distributed submodular maximization with matroid constraints. 2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), 435-442. CrossRef
(2015) Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints. Mathematics of Operations Research 40, 192-225. CrossRef
, , , and . (2015) A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. SIAM Journal on Computing 44:5, 1384-1402. Abstract | PDF (356 KB) 
(2015) On Multiplicative Weight Updates for Concave and Submodular Function Maximization. Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science - ITCS '15, 201-210. CrossRef
, , and . (2014) Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes. SIAM Journal on Computing 43:6, 1831-1879. Abstract | PDF (636 KB) 
(2013) Inequalities on submodular functions via term rewriting. Information Processing Letters 113, 457-464. CrossRef
(2012) A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 649-658. CrossRef
(2012) Theoretical guarantees on penalized information gathering. 2012 IEEE Statistical Signal Processing Workshop (SSP), 301-304. CrossRef
(2011) Approximation Algorithms for Submodular Multiway Partition. 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 807-816. CrossRef
(2010) Submodular Maximization over Multiple Matroids via Generalized Exchange Properties. Mathematics of Operations Research 35, 795-806. CrossRef