Pages that link to "Item:Q2046266"

The following pages link to Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint (Q2046266):

Displaying 11 items.

• Maximization problems of balancing submodular relevance and supermodular diversity (Q2070370) (← links)
• Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice (Q2089671) (← links)
• Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice (Q2150564) (← links)
• A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function (Q2202007) (← links)
• On streaming algorithms for maximizing a supermodular function plus a MDR-submodular function on the integer lattice (Q2682805) (← links)
• Profit maximization in social networks and non-monotone DR-submodular maximization (Q2700789) (← links)
• A fast double greedy algorithm for non-monotone DR-submodular function maximization (Q5216445) (← links)
• A single factor approximation ratio algorithm for DR-submodular maximization on integer lattice beyond non-negativity and monotonicity (Q6118307) (← links)
• A binary search double greedy algorithm for non-monotone DR-submodular maximization (Q6167000) (← links)
• Differentially private submodular maximization with a cardinality constraint over the integer lattice (Q6495887) (← links)
• Streaming algorithms for non-submodular functions maximization with \(d\)-knapsack constraint on the Integer lattice (Q6542993) (← links)