On maximizing a monotone k-submodular function under a knapsack constraint
From MaRDI portal
Publication:2670465
Recommendations
- On maximizing monotone or non-monotone k-submodular functions with the intersection of knapsack and matroid constraints
- Guarantees for maximization of \(k\)-submodular functions with a knapsack and a matroid constraint
- On maximizing a monotone \(k\)-submodular function subject to a matroid constraint
- Monotone \(k\)-submodular knapsack maximization: an analysis of the Greedy+Singleton algorithm
- Maximizing nonmonotone submodular functions under matroid or knapsack constraints
Cites work
- A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint
- A note on maximizing a submodular set function subject to a knapsack constraint
- A threshold of ln n for approximating set cover
- Improved approximation algorithms for \(k\)-submodular function maximization
- Improved randomized algorithm for k-submodular function maximization
- Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
- Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
- Maximizing k-submodular functions and beyond
- On \(k\)-submodular relaxation
- On maximizing a monotone \(k\)-submodular function subject to a matroid constraint
- Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
- The application of the global quasi-linearisation technique to the analysis of the cyclohexane/air mixture autoignition
- Towards minimizing k-submodular functions
Cited in
(35)- Non-monotone submodular function maximization under k-system constraint
- Monotone k-submodular secretary problems: cardinality and knapsack constraints
- Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex --
- Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice
- Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms
- On maximizing monotone or non-monotone k-submodular functions with the intersection of knapsack and matroid constraints
- scientific article; zbMATH DE number 431495 (Why is no real title available?)
- Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints
- Non-monotone submodular maximization under matroid and knapsack constraints
- Improved approximation algorithms for \(k\)-submodular maximization under a knapsack constraint
- Maximization of k-submodular function with a matroid constraint
- Maximizing approximately non-k-submodular monotone set function with matroid constraint
- Weakly \(k\)-submodular maximization under matroid constraint
- Monotone \(k\)-submodular knapsack maximization: an analysis of the Greedy+Singleton algorithm
- Guarantees for maximization of \(k\)-submodular functions with a knapsack and a matroid constraint
- \textsc{Greedy+Singleton}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization
- On maximizing a monotone $k$-submodular function under a knapsack constraint
- An improved analysis of the Greedy+Singleton algorithm for \(k\)-submodular knapsack maximization
- Random approximation algorithms for monotone \(k\)-submodular function maximization with size constraints
- Profit maximization for competitive influence spread in social networks
- Efficient algorithms for k-submodular function maximization with p-system and d-knapsack constraint
- \textsc{Greedy+Max}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization
- k-submodular and approximately non-k-submodular maximization under p-system and knapsack constraints
- On maximizing k-submodular functions under p-system and d-knapsack constraints
- k-submodular interdiction problems under distributional risk-receptiveness and robustness: application to machine learning
- Approximately non-k-submodular maximization under p-system and knapsack constraints
- Budget feasible mechanism for a k-submodular function in the clock auction model
- Maximize an approximate k-submodular function under a knapsack constraint
- Fast algorithms combining threshold-decreasing and greedy methods for maximizing constraint k-submodular functions
- Streaming algorithms for maximizing k-submodular functions with the multi-knapsack constraint
- Streaming algorithms for maximizing k-submodular functions under a partition matroid constraint
- The budget-feasible mechanisms on non-monotone k-submodular objectives for the offline and online procurement auctions
- Approximation algorithms for k-submodular maximization subject to a knapsack constraint
- k-submodular maximization under individual knapsack constraints: applications and streaming algorithm
- Deterministic algorithms for k-submodular maximization with the chance constraint
This page was built for publication: On maximizing a monotone \(k\)-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 Q2670465)
