Optimal streaming algorithms for submodular maximization with cardinality constraints
From MaRDI portal
Cites work
- A new framework for distributed submodular maximization
- A Unified Continuous Greedy Algorithm for Submodular Maximization
- An analysis of approximations for maximizing submodular set functions—I
- Constrained submodular maximization via a nonsymmetric technique
- Constrained submodular maximization: beyond 1/e
- Dependent randomized rounding via exchange properties of combinatorial structures
- scientific article; zbMATH DE number 3904328 (Why is no real title available?)
- Maximizing a monotone submodular function subject to a matroid constraint
- Maximizing Non-monotone Submodular Functions
- Non-monotone submodular maximization under matroid and knapsack constraints
- Online submodular maximization with preemption
- Randomized composable core-sets for distributed submodular maximization
- Streaming algorithms for submodular function maximization
- Submodular maximization meets streaming: matchings, matroids, and more
- Submodular maximization over multiple matroids via generalized exchange properties
- Submodular maximization with cardinality constraints
- Symmetry and approximability of submodular maximization problems
- The one-way communication complexity of submodular maximization with applications to streaming and robustness
Cited in
(3)
This page was built for publication: Optimal streaming algorithms for submodular maximization with cardinality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842576)
