Pages that link to "Item:Q2168767"

The following pages link to Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms (Q2168767):

Displaying 8 items.

• Improved approximation algorithms for \(k\)-submodular maximization under a knapsack constraint (Q6065659) (← links)
• Semi-Streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints (Q6090886) (← 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)
• Profit maximization for competitive influence spread in social networks (Q6591656) (← links)
• Efficient algorithms for \(k\)-submodular function maximization with \(p\)-system and \(d\)-knapsack constraint (Q6606189) (← links)
• \textsc{Greedy+Max}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization (Q6606191) (← links)