Approximation schemes for a class of subset selection problems

Computer Science

• Approximation (Algorithm) 100%
• Argument 100%
• Classes 100%
• Combinatorial Optimization Problem 100%
• Fully Polynomial-Time Approximation Scheme 50%
• Lower Bounds 50%
• Problem Selection 100%
• Rounding Procedure 50%
• Scheduling Problem 50%
• Single Machine 50%

Mathematics

• Approximation 100%
• Bounds 50%
• Classes 100%
• Combinatorial Optimization Problem 100%
• Minimizing 50%
• Number 50%
• Rounding Procedure 50%
• Single Machine 50%
• Subset Selection 100%
• Worst Case 50%

Economics, Econometrics and Finance

• Combinatorial Optimization 100%
• Scheduling Problem 50%