Pages that link to "Item:Q2175059"

The following pages link to A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice (Q2175059):

Displaying 11 items.

• Maximizing monotone submodular functions over the integer lattice (Q1801020) (← links)
• Two approximation algorithms for maximizing nonnegative weakly monotonic set functions (Q2111542) (← links)
• A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function (Q2202007) (← links)
• An optimal streaming algorithm for non-submodular functions maximization on the integer lattice (Q2677650) (← links)
• Profit maximization in social networks and non-monotone DR-submodular maximization (Q2700789) (← links)
• Improved algorithms for non-submodular function maximization problem (Q5970837) (← links)
• A binary search double greedy algorithm for non-monotone DR-submodular maximization (Q6167000) (← links)
• Approximation algorithm of maximizing non-monotone non-submodular functions under knapsack constraint (Q6201343) (← links)
• Streaming algorithms for non-submodular functions maximization with \(d\)-knapsack constraint on the Integer lattice (Q6542993) (← links)
• Greedy algorithm for maximization of semi-monotone non-submodular functions with applications (Q6612543) (← links)
• Approximation algorithm of maximizing non-submodular functions under non-submodular constraint (Q6657221) (← links)