Pages that link to "Item:Q5207510"

The following pages link to Monotone submodular maximization over the bounded integer lattice with cardinality constraints (Q5207510):

Displaying 7 items.

• A short proof for stronger version of DS decomposition in set function optimization (Q830927) (← links)
• Maximizing monotone submodular functions over the integer lattice (Q1801020) (← links)
• On strict submodularity of social influence (Q2025076) (← links)
• Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint (Q2046266) (← links)
• A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice (Q2175059) (← links)
• Profit maximization in social networks and non-monotone DR-submodular maximization (Q2700789) (← links)
• A binary search double greedy algorithm for non-monotone DR-submodular maximization (Q6167000) (← links)