Robust monotone submodular function maximization
Abstract We consider a robust formulation, introduced by Krause et al. (J Artif Intell Res 42:427–486, 2011), of the classical cardinality constrained monotone submodular function maximization problem, and give the first constant factor approximation results. The robustness considered...
Main Authors: | Orlin, James B, Schulz, Andreas S, Udwani, Rajan |
---|---|
Other Authors: | Sloan School of Management |
Format: | Article |
Language: | English |
Published: |
Springer Berlin Heidelberg
2021
|
Online Access: | https://hdl.handle.net/1721.1/131367 |
Similar Items
-
Robust Monotone Submodular Function Maximization
by: Orlin, James B, et al.
Published: (2021) -
Resilient monotone submodular function maximization
by: Tzoumas, Vasileios, et al.
Published: (2018) -
On Maximizing Sums of Non-monotone Submodular and Linear Functions
by: Qi, Benjamin
Published: (2023) -
Distributionally robust submodular maximization
by: Staib, Matthew, et al.
Published: (2021) -
A simple combinatorial algorithm for submodular function minimization
by: Iwata, Satoru, et al.
Published: (2011)