A randomized Sieve-Streaming variant yields a 4.282-approximation semi-streaming algorithm for non-monotone submodular maximization under cardinality constraint, with a 3+ε variant in super-polynomial time.
Nemhauser, Laurence A
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Making a Sieve Random: Improved Semi-Streaming Algorithm for Submodular Maximization under a Cardinality Constraint
A randomized Sieve-Streaming variant yields a 4.282-approximation semi-streaming algorithm for non-monotone submodular maximization under cardinality constraint, with a 3+ε variant in super-polynomial time.