Semi-Streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints
From MaRDI portal
(Redirected from Publication:6090886)
Recommendations
- Streaming algorithms for submodular function maximization
- A survey on streaming algorithms for maximizing submodular functions
- An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint
- Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms
- Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model
- Multi-pass streaming algorithms for monotone submodular function maximization
- Semi-streaming algorithms for submodular matroid intersection
- Semi-streaming algorithms for submodular matroid intersection
Cited in
(7)- Linear programming in the semi-streaming model with application to the maximum matching problem
- Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model
- Semi-streaming algorithms for submodular matroid intersection
- Semi-streaming algorithms for submodular matroid intersection
- Semi-streaming algorithms for submodular function maximization under \(b\)-matching, matroid, and matchoid constraints
- Maximum weight b-matchings in random-order streams
- Semi-streaming algorithms for weighted k-disjoint matchings
This page was built for publication: Semi-Streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090886)
