Pages that link to "Item:Q2569153"

The following pages link to A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem (Q2569153):

Displaying 7 items.

• Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms (Q408438) (← links)
• Maximization of submodular functions: theory and enumeration algorithms (Q1027590) (← links)
• Non-submodular streaming maximization with minimum memory and low adaptive complexity (Q2039664) (← links)
• Non-submodular maximization on massive data streams (Q2307748) (← links)
• A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (Q3449564) (← links)
• Monotone submodular maximization over the bounded integer lattice with cardinality constraints (Q5207510) (← links)
• Constraint generation approaches for submodular function maximization leveraging graph properties (Q6154401) (← links)