Techniques for submodular maximization
From MaRDI portal
Recommendations
- Maximizing Non-monotone Submodular Functions
- Maximization of submodular functions: theory and enumeration algorithms
- Fast algorithms for maximizing submodular functions
- Constrained submodular maximization via greedy local search
- Maximizing nonmonotone submodular functions under matroid or knapsack constraints
Cited in
(15)- Maximization of submodular functions: theory and enumeration algorithms
- A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem
- Randomized composable core-sets for distributed submodular maximization
- Distributed submodular maximization
- On complexity of maximizatin of submodular functions*
- Active-set Methods for Submodular Minimization Problems
- scientific article; zbMATH DE number 2111622 (Why is no real title available?)
- Submodular Maximization Through the Lens of Linear Programming
- Stability and recovery for independence systems
- An efficient branch-and-cut algorithm for submodular function maximization
- Generalized maximum-entropy sampling
- Two-stage submodular maximization under curvature
- Constraint generation approaches for submodular function maximization leveraging graph properties
- Weak submodularity implies localizability: local search for constrained non-submodular function maximization
- Optimum algorithm for maximization of submodular functions
This page was built for publication: Techniques for submodular maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848998)