Pages that link to "Item:Q2670465"
From MaRDI portal
The following pages link to On maximizing a monotone \(k\)-submodular function under a knapsack constraint (Q2670465):
Displayed 10 items.
- Monotone \(k\)-submodular secretary problems: cardinality and knapsack constraints (Q2140573) (← links)
- Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms (Q2168767) (← links)
- On maximizing monotone or non-monotone \(k\)-submodular functions with the intersection of knapsack and matroid constraints (Q2697144) (← links)
- Improved approximation algorithms for \(k\)-submodular maximization under a knapsack constraint (Q6065659) (← links)
- Maximization of \(k\)-submodular function with a matroid constraint (Q6111937) (← links)
- Maximizing approximately non-\(k\)-submodular monotone set function with matroid constraint (Q6111938) (← links)
- Weakly \(k\)-submodular maximization under matroid constraint (Q6111977) (← links)
- Monotone \(k\)-submodular knapsack maximization: an analysis of the Greedy+Singleton algorithm (Q6167014) (← links)
- Guarantees for maximization of \(k\)-submodular functions with a knapsack and a matroid constraint (Q6167015) (← links)
- \textsc{Greedy+Singleton}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization (Q6180752) (← links)