Abstract
Abstract
We consider a two-stage submodular maximization problem subject to a cardinality constraint and k matroid constraints, where the objective function is the expected difference of a nonnegative monotone submodular function and a nonnegative monotone modular function. We give two bi-factor approximation algorithms for this problem. The first is a deterministic
$\left( {{1 \over {k + 1}}\left( {1 - {1 \over {{e^{k + 1}}}}} \right),1} \right)$
-approximation algorithm, and the second is a randomized
$\left( {{1 \over {k + 1}}\left( {1 - {1 \over {{e^{k + 1}}}}} \right) - \varepsilon ,1} \right)$
-approximation algorithm with improved time efficiency.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Reference21 articles.
1. Submodular Max-SAT
2. Mirzasoleiman, B. , Badanidiyuru, A. , Karbasi, A. , Vondraák, J. and Krause, A. (2015). Lazier than lazy greedy. In: AAAI, 1812–1818.
3. Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
4. Ward, J. (2012). Oblivious and Non-Oblivious Local Search for Combinatorial Optimization. Phd thesis, University of Toronto.