A tight linear time (1/2)-approximation for unconstrained submodular maximization

Keyphrases

• Linear Time 100%
• 2-approximation 100%
• Tight 100%
• Unconstrained Submodular Maximization 100%
• Adaptation 33%
• Optimization Problem 33%
• Greedy Approach 33%
• Maximization Problem 33%
• Submodular Function 33%
• Approximation Guarantee 33%
• Hardness Results 33%
• MaxCut 33%
• Facility Location 33%
• MaxSAT 33%
• Linear-time Algorithm 33%
• Symmetry Property 33%
• Submodular Optimization 33%

Mathematics

• Linear Time 100%
• Wide Range 50%
• Max-Cut 50%
• Symmetry Property 50%

Computer Science

• Approximation (Algorithm) 100%
• Optimization Problem 50%
• Symmetry Property 50%