Monotone submodular meta-learning under the matroid constraint
From MaRDI portal
Cites work
- A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint
- A note on maximizing a submodular set function subject to a knapsack constraint
- An analysis of approximations for maximizing submodular set functions-I
- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Comments on bases in dependence structures
- Gadgets, Approximation, and Linear Programming
- Maximizing a monotone submodular function subject to a matroid constraint
- Parallelizing greedy for submodular set function maximization in matroids and beyond
- Sequence submodular maximization meets streaming
- Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
- Submodular functions, matroids, and certain polyhedra
- Submodular maximization meets streaming: matchings, matroids, and more
This page was built for publication: Monotone submodular meta-learning under the matroid constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7405624)