Robust Monotone Submodular Function Maximization
Name
1507.06616.pdf
Size
393.01 KB
Format
Adobe PDF
Checksum (MD5)
a60a943181cd9d772506aa36433a53b5
Author(s)
Orlin, James B
Schulz, Andreas S
Udwani, Rajan
Date Issued
May 2016
Journal
Lecture Notes in Computer Science
Publisher
Springer International Publishing
Citation
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.
Version
Author's final manuscript
Abstract
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.
Description
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9682)
MIT Department
Sloan School of Management
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-319-33461-5_26
