Non-monotone submodular function maximization under k-system constraint
From MaRDI portal
Non-monotone submodular function maximization under \(k\)-system constraint
Recommendations
- Maximizing Non-monotone Submodular Functions
- Maximizing nonmonotone submodular functions under matroid or knapsack constraints
- Maximizing approximately non-k-submodular monotone set function with matroid constraint
- Non-monotone submodular maximization under matroid and knapsack constraints
- Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms
- On maximizing a monotone \(k\)-submodular function subject to a matroid constraint
- On maximizing a monotone \(k\)-submodular function under a knapsack constraint
- Beyond pointwise submodularity: non-monotone adaptive submodular maximization subject to knapsack and \(k\)-system constraints
- Maximizing a monotone non-submodular function under a knapsack constraint
- Maximization of constrained non-submodular functions
Cites work
- A note on maximizing a submodular set function subject to a knapsack constraint
- A Unified Continuous Greedy Algorithm for Submodular Maximization
- An analysis of approximations for maximizing submodular set functions—I
- Deterministic Algorithms for Submodular Maximization Problems
- scientific article; zbMATH DE number 3635849 (Why is no real title available?)
- Maximizing a monotone submodular function subject to a matroid constraint
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
- Maximizing Non-monotone Submodular Functions
- Maximizing nonmonotone submodular functions under matroid or knapsack constraints
- Maximizing submodular set functions subject to multiple linear constraints
- Monotone submodular maximization over a matroid via non-oblivious local search
- Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies
- Non-monotone submodular maximization under matroid and knapsack constraints
- Optimal approximation for the submodular welfare problem in the value oracle model
- Submodular functions and optimization.
- Submodular maximization by simulated annealing
- Submodular maximization with cardinality constraints
- Symmetry and Approximability of Submodular Maximization Problems
- The budgeted maximum coverage problem
Cited in
(4)- On maximizing a monotone \(k\)-submodular function subject to a matroid constraint
- Greedy guarantees for non-submodular function maximization under independent system constraint with applications
- A \(\frac{(k+3)}{2}\)-approximation algorithm for monotone submodular \(k\)-set packing and general \(k\)-exchange systems
- Maximizing Non-monotone Submodular Functions
This page was built for publication: Non-monotone submodular function maximization under \(k\)-system constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2025102)
