Search Results for author:
Found 1 papers, 0 papers with code
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model
The latter one almost matches our lower bound of $\frac{K}{2K-1}$ for a matroid constraint, which almost settles the approximation ratio for a matroid constraint that can be obtained by a streaming algorithm whose space complexity is independent of $n$.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
