Pages that link to "Item:Q896286"

The following pages link to Submodular maximization meets streaming: matchings, matroids, and more (Q896286):

Displaying 38 items.

• Streaming algorithms for robust submodular maximization (Q827610) (← links)
• Online budgeted maximum coverage (Q1979466) (← links)
• Non-submodular streaming maximization with minimum memory and low adaptive complexity (Q2039664) (← links)
• Multi-pass streaming algorithms for monotone submodular function maximization (Q2075395) (← links)
• Almost-smooth histograms and sliding-window graph algorithms (Q2088588) (← 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)
• Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms (Q2168767) (← links)
• Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions (Q2280688) (← links)
• Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint (Q2300732) (← links)
• Non-submodular maximization on massive data streams (Q2307748) (← links)
• Better streaming algorithms for the maximum coverage problem (Q2322721) (← links)
• Submodular maximization over data streams with differential privacy noise (Q2680174) (← links)
• On streaming algorithms for maximizing a supermodular function plus a MDR-submodular function on the integer lattice (Q2682805) (← links)
• Streaming Algorithms for Submodular Function Maximization (Q3448795) (← links)
• Online Submodular Maximization with Preemption (Q4972676) (← links)
• Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams (Q5002618) (← links)
• Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model (Q5028360) (← links)
• An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model (Q5058055) (← links)
• The Power of Subsampling in Submodular Maximization (Q5085145) (← links)
• (Q5090369) (← links)
• (Q5090980) (← links)
• Approximating Robust Parameterized Submodular Function Maximization in Large-Scales (Q5193220) (← links)
• (Q5418997) (redirect page) (← links)
• An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint (Q5870351) (← links)
• Small Space Stream Summary for Matroid Center (Q5875472) (← links)
• (Q5875530) (← links)
• Sequence submodular maximization meets streaming (Q5918267) (← links)
• Semi-streaming algorithms for submodular matroid intersection (Q5918428) (← links)
• Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint (Q5925509) (← links)
• Semi-streaming algorithms for submodular matroid intersection (Q5925648) (← links)
• (Q6062143) (← links)
• FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective (Q6100609) (← links)
• Matroid-constrained vertex cover (Q6162073) (← links)
• Streaming algorithms for non-submodular functions maximization with \(d\)-knapsack constraint on the Integer lattice (Q6542993) (← links)
• Improved linear-time streaming algorithms for maximizing monotone cardinality-constrained set functions (Q6610086) (← links)
• Semi-streaming algorithms for submodular function maximization under \(b\)-matching, matroid, and matchoid constraints (Q6623599) (← links)