Optimal streaming algorithms for submodular maximization with cardinality constraints

Keyphrases

• Approximation Guarantee 100%
• Cardinality Constraint 100%
• Exponential Time 50%
• Fast Update 50%
• Monotone Submodular Functions 50%
• Multilinear Extension 50%
• Nearly Optimal 50%
• Non-monotone 50%
• Offline Algorithm 100%
• Polynomial Time 50%
• Polynomial-time Approximation 50%
• Post-processing Algorithm 50%
• Semi-streaming Algorithms 50%
• Size Constraint 50%
• Streaming Algorithms 100%
• Streaming Model 50%
• Submodular Maximization 100%

Computer Science

• Approximation (Algorithm) 100%
• Cardinality 100%
• Data Structure 16%
• Polynomial Time 33%
• Postprocessing 16%
• Processing Algorithm 16%
• Space Complexity 16%