Greedy guarantees for non-submodular function maximization under independent system constraint with applications
From MaRDI portal
Recommendations
- Non-monotone submodular function maximization under k-system constraint
- New performance guarantees for the greedy maximization of submodular set functions
- Maximization of constrained non-submodular functions
- Nonmonotone submodular maximization via a structural continuous greedy algorithm (extended abstract)
- scientific article; zbMATH DE number 7626767
- Maximizing Non-monotone Submodular Functions
- Greedy algorithm for maximization of non-submodular functions subject to knapsack constraint
- Maximizing nonmonotone submodular functions under matroid or knapsack constraints
- Maximizing a non-decreasing non-submodular function subject to various types of constraints
- Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem
Cites work
- An analysis of approximations for maximizing submodular set functions—I
- An Analysis of the Greedy Heuristic for Independence Systems
- Cauchy's Interlace Theorem for Eigenvalues of Hermitian Matrices
- Design and analysis of approximation algorithms
- Determinantal point processes for machine learning
- Greedy algorithm for maximization of non-submodular functions subject to knapsack constraint
- scientific article; zbMATH DE number 5888315 (Why is no real title available?)
- 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 nonmonotone submodular functions under matroid or knapsack constraints
- Monotone submodular maximization over a matroid via non-oblivious local search
- Non-monotone submodular function maximization under k-system constraint
- Non-monotone submodular maximization under matroid and knapsack constraints
- Non-submodular maximization on massive data streams
- Non-submodular maximization with matroid and knapsack constraints
- Optimal approximation for the submodular welfare problem in the value oracle model
- Restricted strong convexity implies weak submodularity
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
Cited in
(13)- Maximizing a monotone non-submodular function under a knapsack constraint
- Maximize a monotone function with a generic submodularity ratio
- Maximization of constrained non-submodular functions
- Greedy algorithm for maximization of non-submodular functions subject to knapsack constraint
- Minimizing ratio of monotone non-submodular functions
- scientific article; zbMATH DE number 3887436 (Why is no real title available?)
- Maximization of nonsubmodular functions under multiple constraints with applications
- Maximize a monotone function with a generic submodularity ratio
- Fast deterministic algorithms for non-submodular maximization with strong performance guarantees
- Greedy is good: constrained non-submodular function maximization via weak submodularity
- Weak submodularity implies localizability: local search for constrained non-submodular function maximization
- Approximation algorithm of maximizing non-submodular functions under non-submodular constraint
- Submodular + supermodular function maximization with knapsack constraint
This page was built for publication: Greedy guarantees for non-submodular function maximization under independent system constraint with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2696953)
