Stochastic Greedy with a rejection rule for non-positive marginal gains achieves an expected 1/4-approximation for non-monotone submodular maximization under a cardinality constraint in linear oracle queries.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint
Stochastic Greedy with a rejection rule for non-positive marginal gains achieves an expected 1/4-approximation for non-monotone submodular maximization under a cardinality constraint in linear oracle queries.