Pages that link to "Item:Q2202007"

The following pages link to A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function (Q2202007):

Displaying 9 items.

• Maximizing monotone submodular functions over the integer lattice (Q1801020) (← links)
• Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex -- (Q2149546) (← links)
• A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice (Q2175059) (← links)
• A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice (Q2679235) (← links)
• Profit maximization in social networks and non-monotone DR-submodular maximization (Q2700789) (← links)
• (Q4969210) (← 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)