On the complexity and approximation of the maximum expected value all-or-nothing subset

Keyphrases

• Expected Maxima 100%
• All-or-nothing 100%
• Linear Problem 66%
• NP-hard 33%
• Set Systems 33%
• Fully Polynomial Time Approximation Scheme 33%
• Binary Optimization Problem 33%
• Subset Sum 33%
• Matroid Intersection 33%
• Downward Closed Sets 33%
• Polynomial-time Approximation Scheme 33%
• Nonlinear Binary Optimization 33%

Mathematics

• Probability Theory 100%
• Linear Problem 50%
• Fully Polynomial-Time Approximation Scheme 25%
• Closed Set 25%
• Subset Sum 25%
• Polynomial Time 25%