Distributed robust sequential submodular maximization under partition matroid constraints
From MaRDI portal
Cites work
- A distributed algorithm for robust sequential submodular optimization in multi-robot systems
- Deletion robust non-monotone submodular maximization over matroids
- Optimal approximation for submodular and supermodular optimization with bounded curvature
- Robust and Adaptive Sequential Submodular Optimization
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
This page was built for publication: Distributed robust sequential submodular maximization under partition matroid constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307952)