Submodular Maximization in Clean Linear Time

Keyphrases

• Deterministic Algorithm 100%
• Linear Time 100%
• Submodular Maximization 100%
• Monotone 66%
• Knapsack Constraint 66%
• Cardinality 33%
• Tight 33%
• Randomized Algorithms 33%
• 2-approximation 33%
• Approximation Ratio 33%
• Set Systems 33%
• Real-world Application 33%
• Approximation Guarantee 33%
• Time Deterministic 33%
• Size Constraint 33%
• Constant Approximation 33%
• Monotone Submodular Functions 33%
• Movie Recommendation 33%
• Video Summarization 33%
• Number of Function Evaluations 33%
• Text Summarization 33%
• Multiple Knapsack 33%
• Function Evaluation 33%
• Twitter Posts 33%
• Information-theoretic Bounds 33%
• Maximum Cardinality 33%

Computer Science

• Approximation (Algorithm) 100%
• Cardinality 100%
• Knapsack 100%
• Function Evaluation 100%
• Randomized Algorithm 50%
• Approximation Ratio 50%
• Video Summarization 50%
• Text Summarization 50%