The one-way communication complexity of submodular maximization with applications to streaming and robustness

Keyphrases

• Communication Complexity 100%
• Tight 100%
• Submodular Maximization 100%
• One-way Communication 100%
• Cardinality Constraint 66%
• Hardness Results 66%
• Approximation Factor 66%
• Streaming Model 33%
• Monotone Submodular Functions 33%
• Submodular Function 33%
• Approximation Algorithms 33%
• Information Theory 33%
• Feasible Set 33%
• Result-oriented 33%
• Computational Model 33%
• Streaming Algorithms 33%
• Number of Players 33%
• Exponential Time 33%
• Approximation Results 33%
• Offline Model 33%
• Player Model 33%
• Coverage Functions 33%
• Complexity Results 33%

Computer Science

• Approximation (Algorithm) 100%
• Communication Complexity 100%
• Cardinality 66%
• approximation factor 66%
• Data Stream 33%
• Computational Modeling 33%
• Approximation Algorithms 33%
• Classical Problem 33%
• Complexity Result 33%

Mathematics

• Cardinality 100%
• Feasible Set 50%
• Approximability 50%
• Exponential Time 50%