\textsc{Greedy+Singleton}: an efficient approximation algorithm for k-submodular knapsack maximization
From MaRDI portal
Publication:6180752
Cites work
- A note on maximizing a submodular set function subject to a knapsack constraint
- A refined analysis of submodular greedy
- An exact cutting plane method for \(k\)-submodular function maximization
- Guarantees for maximization of \(k\)-submodular functions with a knapsack and a matroid constraint
- Improved approximation algorithms for \(k\)-submodular function maximization
- Improved randomized algorithm for \(k\)-submodular function maximization
- Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
- Maximization of \(k\)-submodular function with a matroid constraint
- Maximizing \(k\)-submodular functions and beyond
- Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms
- Monotone \(k\)-submodular knapsack maximization: an analysis of the Greedy+Singleton algorithm
- Monotone \(k\)-submodular secretary problems: cardinality and knapsack constraints
- On \(k\)-submodular relaxation
- On maximizing a monotone \(k\)-submodular function subject to a matroid constraint
- On maximizing a monotone \(k\)-submodular function under a knapsack constraint
- On maximizing monotone or non-monotone \(k\)-submodular functions with the intersection of knapsack and matroid constraints
- The application of the global quasi-linearisation technique to the analysis of the cyclohexane/air mixture autoignition
- The budgeted maximum coverage problem
- The generalized maximum coverage problem
- Towards minimizing \(k\)-submodular functions
This page was built for publication: \textsc{Greedy+Singleton}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6180752)
