Pages that link to "Item:Q5855531"

The following pages link to Improved Randomized Algorithm for <i>k</i>-Submodular Function Maximization (Q5855531):

Displaying 9 items.

• Monotone \(k\)-submodular secretary problems: cardinality and knapsack constraints (Q2140573) (← 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)
• (Q3403832) (← links)
• <i>k</i>-Submodular maximization with two kinds of constraints (Q5013487) (← links)
• \textsc{Greedy+Singleton}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization (Q6180752) (← links)
• An improved analysis of the Greedy+Singleton algorithm for \(k\)-submodular knapsack maximization (Q6535797) (← links)
• Random approximation algorithms for monotone \(k\)-submodular function maximization with size constraints (Q6535807) (← links)
• \textsc{Greedy+Max}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization (Q6606191) (← links)