Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms
Open accessThe DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Abstract
Constrained submodular maximization problems have long been studied, most recently in the context of auctions and computational advertising, with near-optimal results known under a variety of constraints when the submodular function is monotone. In this paper, we give constant approximation algorithms for the non-monotone case that work for p-independence systems (which generalize constraints given by the intersection of p matroids that had been studied previously), where the running time is poly(n, p). Our algorithms and analyses are simple, and essentially reduce non-monotone maximization to multiple runs of the greedy algorithm previously used in the monotone case. We extend these ideas to give a simple greedy-based constant factor algorithms for non-monotone submodular maximization subject to a knapsack constraint, and for (online) secretary setting (where elements arrive one at a time in random order and the algorithm must make irrevocable decisions) subject to uniform matroid or a partition matroid constraint. Finally, we give an O(log k) approximation in the secretary setting subject to a general matroid constraint of rank k.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Maximizing the spread of influence through a social network
Kempe, D., Kleinberg, J., & Tardos, É. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956769 · Cited by 7,326 · cited 1×
“The problem of selecting a subset of people in a social network to maximize their influence in a viral marketing campaign can be modeled as a constrained submodular maximization problem [21,30].”
BackgroundAn analysis of approximations for maximizing submodular set functions—I
Nemhauser, G. L., Wolsey, L. A., & Fisher, M. L. (1978) · Mathematical Programming · doi:10.1007/bf01588971 · Cited by 4,412 · cited 1×
“The (offline) monotone submodular optimization problem has been long studied: Fisher, Nemhauser, and Wolsey [31,15] showed that the greedy and local-search algorithms give a (e/e − 1)-approximation with cardinality constraints, and a (p+1)-approximation under p matroid constraints.”
MethodThe budgeted maximum coverage problem
Khuller, S., Moss, A., & Naor, J. (. (1999) · Information Processing Letters · doi:10.1016/s0020-0190(99)00031-9 · Cited by 982 · cited 1×
“Sviridenko [Svi04] extended results of Wolsey [Wol82] and Khuller et al. [KMN99] to show that a greedy-like algorithm with partial enumeration gives an (1 1 / e)-approximation to monotone submodular maximization subject to a knapsack constraint.”
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
Calinescu, G., Chekuri, C., Pál, M., & Vondrák, J. (2011) · SIAM Journal on Computing · doi:10.1137/080733991 · Cited by 795 · cited 4×
“The proof of the following lemma appears in Section A, and closely follows that for the monotone case from [CCPV09].”
BackgroundResultInfluentialA note on maximizing a submodular set function subject to a knapsack constraint
Sviridenko, M. (2004) · Operations Research Letters · doi:10.1016/s0167-6377(03)00062-2 · Cited by 690 · cited 5×
“Sviridenko [Svi04] extended results of Wolsey [Wol82] and Khuller et al. [KMN99] to show that a greedy-like algorithm with partial enumeration gives an (1 1 / e)-approximation to monotone submodular maximization subject to a knapsack constraint.”
BackgroundMethodResultInfluentialWho Solved the Secretary Problem?
Ferguson, T. S. (1989) · Statistical Science · doi:10.1214/ss/1177012493 · Cited by 663 · cited 1×
“The original secretary problem seeks to maximize the probability of picking the element in a collection having the highest value, given that the elements are examined in random order [Dyn63, Fre83, Fer89].”
BackgroundAn analysis of approximations for maximizing submodular set functions—II
Fisher, M. L., Nemhauser, G. L., & Wolsey, L. A. (1978) · Mathematical Programming Studies · doi:10.1007/bfb0121195 · Cited by 589
Optimal approximation for the submodular welfare problem in the value oracle model
Vondrak, J. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374389 · Cited by 546 · cited 1×
“how to maximize monotone submodular functions representable as weighted matroid rank functions subject to any matroid with an approximation ratio of (e/e−1), and soon thereafter, Vondrák extended this result to all submodular functions [33]; these highly influential results appear jointly in [8].”
BackgroundA Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
Chekuri, C., & Khanna, S. (2005) · SIAM Journal on Computing · doi:10.1137/s0097539700382820 · Cited by 332 · cited 1×
“[17, Section F.1] extends ideas from [ 9 ] to give polynomial-time algorithms with respect to non-monotone submodular maximization with respect to a p-system and q knapsacks: these algorithms achieve an p+q+O(1)-approximation for constant q (since the running time is n poly(q) ),”
BackgroundOn the submodularity of influence in social networks
Mossel, E., & Roch, S. (2007) · Proceedings of the thirty-ninth annual ACM symposium on Theory of computing · doi:10.1145/1250790.1250811 · Cited by 217 · cited 1×
“The problem of selecting a subset of people in a social network to maximize their influence in a viral marketing campaign can be modeled as a constrained submodular maximization problem [21, 30 ].”
Background
Cited by
Submodular Function Maximization
Krause, A., & Golovin, D. (2014) · Tractability · doi:10.1017/cbo9781139177801.004 · Cited by 751
Streaming submodular maximization: massive data summarization on the fly
Badanidiyuru, A., Mirzasoleiman, B., Karbasi, A., & Krause, A. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623637 · Cited by 300
Free Market of Crowdsourcing: Incentive Mechanism Design for Mobile Sensing
Zhang, X., Yang, Z., Zhou, Z., Cai, H., Chen, L., & Li, X. (2014) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2013.2297112 · Cited by 245
“The utility of T is thus uðT Þ, which has been proved to be Oð1Þ-competitive compared with the optimal solution [24].”
BackgroundMethodInfluentialA Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
Buchbinder, N., Feldman, M., Naor, J., & Schwartz, R. (2012) · 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2012.73 · Cited by 216
“Many works consider the problem of maximizing a nonnegative submodular function subject to various combinatorial constraints defining the feasible solutions [13], [19], [30], [31], [39], or minimizing a submodular function subject to such constraints [23], [24], [35].”
Metadata
- Authors
- Gupta, A., Roth, A., Schoenebeck, G., & Talwar, K.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2010
- Pages
- 246-257
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1503396090
- Cited by
- 165
- References
- 24
- FWCI
- 11.00
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms. https://app.cochat.ai/papers/10.1007/978-3-642-17572-5_20
- The paper
- Gupta, A., Roth, A., Schoenebeck, G., & Talwar, K. (2010). Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-17572-5_20
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.