Pages that link to "Item:Q5870351"
From MaRDI portal
The following pages link to An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint (Q5870351):
Displaying 15 items.
- Streaming algorithms for robust submodular maximization (Q827610) (← links)
- Submodular maximization meets streaming: matchings, matroids, and more (Q896286) (← links)
- 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)
- Non-submodular maximization on massive data streams (Q2307748) (← links)
- An optimal streaming algorithm for non-submodular functions maximization on the integer lattice (Q2677650) (← links)
- Streaming submodular maximization under \(d\)-knapsack constraints (Q2682804) (← links)
- Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model (Q5028360) (← links)
- The Power of Subsampling in Submodular Maximization (Q5085145) (← links)
- The one-way communication complexity of submodular maximization with applications to streaming and robustness (Q5145019) (← links)
- Thresholding Methods for Streaming Submodular Maximization with a Cardinality Constraint and Its Variants (Q5864849) (← 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)
- Semi-Streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints (Q6090886) (← links)
