Maximizing stochastic set function under a matroid constraint from decomposition
From MaRDI portal
Recommendations
- Novel algorithms for maximum DS decomposition
- An adaptive algorithm for maximization of non-submodular function with a matroid constraint
- Parametric monotone function maximization with matroid constraints
- An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model
- Stochastic conditional gradient methods: from convex minimization to submodular maximization
Cites work
- scientific article; zbMATH DE number 3635849 (Why is no real title available?)
- scientific article; zbMATH DE number 7788642 (Why is no real title available?)
- A Unified Continuous Greedy Algorithm for Submodular Maximization
- Adaptive submodularity: theory and applications in active learning and stochastic optimization
- An analysis of approximations for maximizing submodular set functions—I
- Maximizing a monotone submodular function subject to a matroid constraint
- Novel algorithms for maximum DS decomposition
- Stochastic conditional gradient++: (Non)convex minimization and continuous submodular maximization
- Stochastic submodular cover with limited adaptivity
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- Submodular stochastic probing on matroids
This page was built for publication: Maximizing stochastic set function under a matroid constraint from decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621839)
