Maximization of constrained non-submodular functions
From MaRDI portal
Recommendations
- Greedy is good: constrained non-submodular function maximization via weak submodularity
- Greedy guarantees for non-submodular function maximization under independent system constraint with applications
- Approximation algorithm of maximizing non-submodular functions under non-submodular constraint
- Maximization of nonsubmodular functions under multiple constraints with applications
- Non-submodular maximization with matroid and knapsack constraints
Cited in
(11)- Greedy is good: constrained non-submodular function maximization via weak submodularity
- Approximation algorithm of maximizing non-submodular functions under non-submodular constraint
- Maximizing Non-monotone Submodular Functions
- Non-monotone submodular function maximization under \(k\)-system constraint
- Nonsubmodular Constrained Profit Maximization in Attribute Networks
- On streaming algorithms for maximizing a supermodular function plus a MDR-submodular function on the integer lattice
- Greedy guarantees for non-submodular function maximization under independent system constraint with applications
- An adaptive algorithm for maximization of non-submodular function with a matroid constraint
- Fast deterministic algorithms for non-submodular maximization with strong performance guarantees
- Sequence submodular maximization meets streaming
- Maximizing a class of submodular utility functions with constraints
This page was built for publication: Maximization of constrained non-submodular functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2300075)