Submodular maximization with cardinality constraints

Keyphrases

• Tight 100%
• Submodular Maximization 100%
• Cardinality Constraint 100%
• Non-monotone 75%
• Time Complexity 50%
• Greedy Algorithm 50%
• Practical Setting 50%
• Monotone 25%
• Information Retrieval 25%
• 2-approximation 25%
• Machine Learning 25%
• Improved Approximation 25%
• Processing Information 25%
• Natural Language Processing 25%
• Fisher 25%
• Number of Elements 25%
• Combinatorial Optimization Problem 25%
• Max-bisection 25%
• Monotone Submodular Functions 25%
• Greedy Method 25%
• Wolsey 25%
• Natural Substitutes 25%
• Greedy Approach 25%
• Monotone Functions 25%
• Random Element 25%
• Element Change 25%
• Information Machine 25%
• Double Greedy 25%
• Natural Rate 25%
• K-coverage 25%
• Unconstrained Submodular Maximization 25%

Computer Science

• Approximation (Algorithm) 100%
• Cardinality 100%
• Time Complexity 28%
• Greedy Algorithm 28%
• Natural Language Processing 14%
• Combinatorial Optimization Problem 14%
• Monotone Function 14%
• Machine Learning 14%
• Learning System 14%
• Information Retrieval 14%

Mathematics

• Cardinality 100%
• Greedy Algorithm 66%
• Combinatorial Optimization Problem 33%
• Random Element 33%
• Natural Rate 33%
• Total Number 33%
• Monotone Function 33%