Pages that link to "Item:Q2307748"

The following pages link to Non-submodular maximization on massive data streams (Q2307748):

Displaying 14 items.

• Non-submodular streaming maximization with minimum memory and low adaptive complexity (Q2039664) (← links)
• Bicriteria streaming algorithms to balance gain and cost with cardinality constraint (Q2084653) (← links)
• Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice (Q2089671) (← links)
• A linear-time streaming algorithm for cardinality-constrained maximizing monotone non-submodular set functions (Q2149859) (← links)
• Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice (Q2150564) (← links)
• An optimal streaming algorithm for non-submodular functions maximization on the integer lattice (Q2677650) (← links)
• On streaming algorithms for maximizing a supermodular function plus a MDR-submodular function on the integer lattice (Q2682805) (← links)
• Greedy guarantees for non-submodular function maximization under independent system constraint with applications (Q2696953) (← links)
• Randomized Parallel Algorithm for Maximizing Nonsubmodular Function Subject to Cardinality Constraint (Q5024901) (← links)
• Sequence submodular maximization meets streaming (Q5918267) (← links)
• Improved algorithms for non-submodular function maximization problem (Q5918732) (← links)
• Fast algorithms for maximizing monotone nonsubmodular functions (Q5918746) (← links)
• Improved algorithms for non-submodular function maximization problem (Q5970837) (← links)
• Streaming algorithms for maximizing the difference of submodular functions and the sum of submodular and supermodular functions (Q6164960) (← links)