Robust Monotone Submodular Function Maximization
Author(s)Orlin, James B; Schulz, Andreas S; Udwani, Rajan
MetadataShow full item record
We consider a robust formulation, introduced by Krause et al. (2008), of the classic cardinality constrained monotone submodular function maximization problem, and give the first constant factor approximation results. The robustness considered is w.r.t. adversarial removal of a given number of elements from the chosen set. In particular, for the fundamental case of single element removal, we show that one can approximate the problem up to a factor (1−1/e)−ϵ by making O(n 1/ϵ) queries, for arbitrary ϵ > 0. The ideas are also extended to more general settings.
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9682)
DepartmentSloan School of Management
Lecture Notes in Computer Science
Springer International Publishing
Orlin, James B., Andreas S. Schulz, and Rajan Udwani. “Robust Monotone Submodular Function Maximization.” IPCO 2016: Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, Springer 2016, 312–324. © 2016 Springer International Publishing Switzerland.
Author's final manuscript
The following license files are associated with this item: