Pages that link to "Item:Q2788997"

The following pages link to Submodular Function Maximization on the Bounded Integer Lattice (Q2788997):

Displaying 11 items.

• Maximizing monotone submodular functions over the integer lattice (Q1801020) (← links)
• Robust budget allocation via continuous submodular functions (Q2019911) (← links)
• Rank axiom of modular supermatroids: a connection with directional DR submodular functions (Q2070084) (← 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 algorithm for maximizing a non-monotone DR-submodular integer lattice function (Q2202007) (← links)
• Profit maximization in social networks and non-monotone DR-submodular maximization (Q2700789) (← links)
• A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions (Q3297828) (← links)
• Monotone submodular maximization over the bounded integer lattice with cardinality constraints (Q5207510) (← 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)