No CrossRef data available.
Article contents
Two-stage submodular maximization problem beyond nonnegative and monotone
Published online by Cambridge University Press: 16 November 2021
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.
- Type
- Special Issue: TAMC 2022
- Information
- Mathematical Structures in Computer Science , Volume 34 , Special Issue 3: Theory and Applications of Models of Computation , March 2024 , pp. 211 - 226
- Copyright
- © The Author(s), 2021. Published by Cambridge University Press
Footnotes
A preliminary version of the paper Liu et al. (2020) appeared in the 16th Annual Conference on Theory and Applications of Models of Computation 2020.