Pages that link to "Item:Q3448795"
From MaRDI portal
The following pages link to Streaming Algorithms for Submodular Function Maximization (Q3448795):
Displayed 21 items.
- Non-submodular streaming maximization with minimum memory and low adaptive complexity (Q2039664) (← links)
- Multi-pass streaming algorithms for monotone submodular function maximization (Q2075395) (← links)
- Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint (Q2300732) (← links)
- Better streaming algorithms for the maximum coverage problem (Q2322721) (← links)
- Fractional Set Cover in the Streaming Model. (Q5002615) (← 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)
- The Power of Subsampling in Submodular Maximization (Q5085145) (← links)
- (Q5090980) (← links)
- Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint (Q5094029) (← links)
- Современные методы математического моделирования развития гидродинамических неустойчивостей и турбулентного перемешивания (Q5141803) (← links)
- Approximating Robust Parameterized Submodular Function Maximization in Large-Scales (Q5193220) (← links)
- Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online (Q5868957) (← links)
- An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint (Q5870351) (← links)
- Small Space Stream Summary for Matroid Center (Q5875472) (← links)
- Approximate F_2-Sketching of Valuation Functions (Q5875529) (← links)
- Sequence submodular maximization meets streaming (Q5918267) (← links)
- Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint (Q5925509) (← links)
- FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective (Q6100609) (← links)
- Matroid-constrained vertex cover (Q6162073) (← links)
- Streaming submodular maximization with the chance constraint (Q6166877) (← links)
