Pages that link to "Item:Q2697144"

The following pages link to On maximizing monotone or non-monotone \(k\)-submodular functions with the intersection of knapsack and matroid constraints (Q2697144):

Displaying 9 items.

• On maximizing a monotone \(k\)-submodular function subject to a matroid constraint (Q1751212) (← links)
• An exact cutting plane method for \(k\)-submodular function maximization (Q2067498) (← links)
• Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice (Q2150564) (← links)
• An Integer Programming Formulation for the Maximum k-Subset Intersection Problem (Q3195319) (← links)
• Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints (Q5169688) (← links)
• Non-monotone submodular maximization under matroid and knapsack constraints (Q5172726) (← 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)
• Efficient algorithms for \(k\)-submodular function maximization with \(p\)-system and \(d\)-knapsack constraint (Q6606189) (← links)