Pages that link to "Item:Q5145019"

The following pages link to The one-way communication complexity of submodular maximization with applications to streaming and robustness (Q5145019):

Displaying 8 items.

• Multi-pass streaming algorithms for monotone submodular function maximization (Q2075395) (← links)
• A linear-time streaming algorithm for cardinality-constrained maximizing monotone non-submodular set functions (Q2149859) (← links)
• Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model (Q5028360) (← links)
• An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint (Q5870351) (← links)
• Fast algorithms for maximizing monotone nonsubmodular functions (Q5918746) (← 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)
• Improved linear-time streaming algorithms for maximizing monotone cardinality-constrained set functions (Q6610086) (← links)