A general framework for designing approximation schemes for combinatorial optimization problems with many objectives combined into one

Keyphrases

• Combinatorial Optimization Problem 100%
• Resource Allocation Problem 100%
• Approximation Scheme 100%
• FPTAS 100%
• Many-objective 100%
• Parallel for 50%
• Multi-criteria Optimization 50%
• Space Constraints 50%
• Approximation Algorithms 50%
• L-norm 50%
• Fully Polynomial Time Approximation Scheme 50%
• Novel Resources 50%
• Hardness Results 50%
• Hardness of Approximation 50%
• Unrelated Parallel Machines 50%
• Scheduling Jobs 50%
• Santa Claus 50%
• Main Idea 50%
• Pareto Optimal Frontier 50%

Computer Science

• Combinatorial Optimization Problem 100%
• Fully Polynomial-Time Approximation Scheme 100%
• approximation scheme 100%
• Allocation Problem 66%
• Resource Allocation 66%
• Optimization Problem 33%
• Multicriteria Optimization 33%
• Approximation Algorithms 33%
• Parallel Machine 33%
• Space Requirement 33%
• Job Scheduling 33%
• Objective Function 33%
• Input Parameter 33%

Mathematics

• Combinatorial Optimization Problem 100%
• Fully Polynomial-Time Approximation Scheme 100%
• Approximates 33%
• Polynomial 33%
• Objective Function 33%
• Pareto Optimal 33%
• Input Parameter 33%