Two-stage submodular maximization under curvature
From MaRDI portal
Recommendations
Cites work
- A constrained two-stage submodular maximization
- An analysis of approximations for maximizing submodular set functions—I
- Approximating the least core value and least core of cooperative games with supermodular costs
- scientific article; zbMATH DE number 3635849 (Why is no real title available?)
- Improved approximations for k-exchange systems (extended abstract)
- Maximizing nonmonotone submodular functions under matroid or knapsack constraints
- New performance guarantees for the greedy maximization of submodular set functions
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
Cited in
(4)
This page was built for publication: Two-stage submodular maximization under curvature
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5925698)