Pages that link to "Item:Q2140573"

The following pages link to Monotone \(k\)-submodular secretary problems: cardinality and knapsack constraints (Q2140573):

Displaying 3 items.

• \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)
• \textsc{Greedy+Max}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization (Q6606191) (← links)