Pages that link to "Item:Q5918746"

The following pages link to Fast algorithms for maximizing monotone nonsubmodular functions (Q5918746):

Displaying 9 items.

• Parametric monotone function maximization with matroid constraints (Q2010096) (← links)
• Two approximation algorithms for maximizing nonnegative weakly monotonic set functions (Q2111542) (← links)
• A new greedy strategy for maximizing monotone submodular function under a cardinality constraint (Q2141724) (← links)
• Maximize a monotone function with a generic submodularity ratio (Q2220848) (← links)
• Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms (Q2321329) (← links)
• Minimizing ratio of monotone non-submodular functions (Q2326079) (← links)
• Stochastic-lazier-greedy algorithm for monotone non-submodular maximization (Q2666680) (← links)
• Multi-objective evolutionary algorithms are generally good: maximizing monotone submodular functions over sequences (Q2681004) (← links)
• Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint (Q5918747) (← links)