Pages that link to "Item:Q4575607"
From MaRDI portal
The following pages link to Improved Approximation Algorithms for <i>k</i>-Submodular Function Maximization (Q4575607):
Displaying 17 items.
- A compact representation for minimizers of \(k\)-submodular functions (Q1631630) (← links)
- On maximizing a monotone \(k\)-submodular function subject to a matroid constraint (Q1751212) (← links)
- Maximizing monotone submodular functions over the integer lattice (Q1801020) (← links)
- An exact cutting plane method for \(k\)-submodular function maximization (Q2067498) (← links)
- 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 a monotone \(k\)-submodular function under a knapsack constraint (Q2670465) (← links)
- On maximizing monotone or non-monotone \(k\)-submodular functions with the intersection of knapsack and matroid constraints (Q2697144) (← links)
- On $k$-Submodular Relaxation (Q2820856) (← links)
- <i>k</i>-Submodular maximization with two kinds of constraints (Q5013487) (← links)
- Improved Randomized Algorithm for <i>k</i>-Submodular Function Maximization (Q5855531) (← 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)
- 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)