Greed Is Good: Near-Optimal Submodular Maximization via Greedy Optimization

Keyphrases

• Greedy Algorithm 100%
• Submodular Maximization 100%
• Submodular Function 100%
• Near-optimal 100%
• Function Evaluation 100%
• Greed 100%
• System Constraints 100%
• Greedy Optimization 100%
• Order of Magnitude 50%
• Sampling Methods 50%
• Monotone Submodular Functions 50%
• Greedy Method 50%
• Approximation Ratio 50%
• Deterministic Algorithm 50%
• Randomized Algorithms 50%
• Polynomial-time Algorithm 50%
• Time Lead 50%
• Feasible Solution 50%
• Extended Systems 50%
• Movie Recommendation 50%
• Maximum Size 50%
• K-functional 50%
• Non-monotonicity 50%
• Concrete Application 50%

Computer Science

• Approximation (Algorithm) 100%
• Function Evaluation 100%
• System Constraint 100%
• Greedy Algorithm 100%
• Randomized Algorithm 50%
• Approximation Ratio 50%
• Feasible Solution 50%
• Polynomial Time Algorithm 50%
• Subclasses 50%

Mathematics

• Greedy Algorithm 100%
• Function Evaluation 100%
• Polynomial Time 50%
• Feasible Solution 50%
• Sampling Procedure 50%