Maximizing a monotone non-submodular function under a knapsack constraint
From MaRDI portal
Recommendations
- Non-submodular maximization with matroid and knapsack constraints
- Non-monotone submodular maximization under matroid and knapsack constraints
- Greedy guarantees for non-submodular function maximization under independent system constraint with applications
- Maximizing nonmonotone submodular functions under matroid or knapsack constraints
- Maximizing a monotone submodular function with a bounded curvature under a knapsack constraint
Cites work
- A note on maximizing a submodular set function subject to a knapsack constraint
- An analysis of approximations for maximizing submodular set functions—I
- Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines
- Bayesian experimental design: A review
- Maximizing a monotone submodular function subject to a matroid constraint
- Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
Cited in
(13)- Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints
- 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 maximization with multiple knapsacks in static and dynamic settings
- scientific article; zbMATH DE number 431495 (Why is no real title available?)
- Non-monotone submodular maximization under matroid and knapsack constraints
- Non-monotone submodular function maximization under \(k\)-system constraint
- Minimizing ratio of monotone non-submodular functions
- Non-submodular maximization with matroid and knapsack constraints
- Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice
- Approximation for maximizing monotone non-decreasing set functions with a greedy method
- Maximizing a monotone submodular function with a bounded curvature under a knapsack constraint
This page was built for publication: Maximizing a monotone non-submodular function under a knapsack constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2156291)
