Submodular maximization subject to matroid intersection on the fly
From MaRDI portal
Cites work
- A threshold of ln n for approximating set cover
- An analysis of approximations for maximizing submodular set functions—I
- An Analysis of the Greedy Heuristic for Independence Systems
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Better streaming algorithms for the maximum coverage problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- scientific article; zbMATH DE number 3544074 (Why is no real title available?)
- scientific article; zbMATH DE number 3635849 (Why is no real title available?)
- scientific article; zbMATH DE number 7788450 (Why is no real title available?)
- scientific article; zbMATH DE number 7788452 (Why is no real title available?)
- Independent sets in vertex-arrival streams
- Maximizing a monotone submodular function subject to a matroid constraint
- On the complexity of approximating \(k\)-set packing
- Optimal streaming algorithms for submodular maximization with cardinality constraints
- Private vs. common random bits in communication complexity
- Streaming algorithms for submodular function maximization
- Submodular maximization meets streaming: matchings, matroids, and more
- Submodular maximization over multiple matroids via generalized exchange properties
- The one-way communication complexity of submodular maximization with applications to streaming and robustness
This page was built for publication: Submodular maximization subject to matroid intersection on the fly
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969630)
