Pages that link to "Item:Q1751212"

The following pages link to On maximizing a monotone \(k\)-submodular function subject to a matroid constraint (Q1751212):

Displaying 17 items.

• Maximizing monotone submodular functions over the integer lattice (Q1801020) (← links)
• Non-monotone submodular function maximization under \(k\)-system constraint (Q2025102) (← 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)
• A \(\frac{(k+3)}{2}\)-approximation algorithm for monotone submodular \(k\)-set packing and general \(k\)-exchange systems (Q2904748) (← links)
• Improved Approximation Algorithms for <i>k</i>-Submodular Function Maximization (Q4575607) (← links)
• Non-monotone submodular maximization under matroid and knapsack constraints (Q5172726) (← links)
• Monotone submodular maximization over the bounded integer lattice with cardinality constraints (Q5207510) (← links)
• Improved approximation algorithms for \(k\)-submodular maximization under a knapsack constraint (Q6065659) (← 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)
• 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)