Random approximation algorithms for monotone k-submodular function maximization with size constraints
From MaRDI portal
Publication:6535807
Recommendations
- Improved randomized algorithm for \(k\)-submodular function maximization
- \(k\)-submodular maximization with two kinds of constraints
- 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
Cites work
- A note on maximizing a submodular set function subject to a knapsack constraint
- A tight linear time (1/2)-approximation for unconstrained submodular 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
- 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
- Maximizing a monotone submodular function subject to a matroid constraint
- On \(k\)-submodular relaxation
- On maximizing a monotone \(k\)-submodular function subject to a matroid constraint
- Towards minimizing \(k\)-submodular functions
This page was built for publication: Random approximation algorithms for monotone \(k\)-submodular function maximization with size constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535807)
