Weak submodularity implies localizability: local search for constrained non-submodular function maximization
From MaRDI portal
Recommendations
- Maximizing a non-decreasing non-submodular function subject to various types of constraints
- Constrained submodular maximization via greedy local search
- Greedy is good: constrained non-submodular function maximization via weak submodularity
- Techniques for submodular maximization
- Improved algorithms for non-submodular function maximization problem
Cites work
- A \(\frac{(k+3)}{2}\)-approximation algorithm for monotone submodular \(k\)-set packing and general \(k\)-exchange systems
- An analysis of approximations for maximizing submodular set functions—I
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Greedy guarantees for non-submodular function maximization under independent system constraint with applications
- Greedy is good: constrained non-submodular function maximization via weak submodularity
- scientific article; zbMATH DE number 3635849 (Why is no real title available?)
- Maximize a monotone function with a generic submodularity ratio
- Maximizing a monotone submodular function subject to a matroid constraint
- Monotone submodular maximization over a matroid via non-oblivious local search
- Optimal approximation for the submodular welfare problem in the value oracle model
- Submodular maximization over multiple matroids via generalized exchange properties
This page was built for publication: Weak submodularity implies localizability: local search for constrained non-submodular function maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646409)
