Breaking symmetries to rescue sum of squares in the case of makespan scheduling

Keyphrases

• Symmetry Breaking 100%
• Integrality Gap 100%
• Sum of Squares 100%
• Makespan Scheduling 100%
• Linear Programming 75%
• Sum-of-squares Hierarchy 50%
• Tight 25%
• Convex Relaxation 25%
• Better Approximation 25%
• Polynomial Complexity 25%
• Identical Machines 25%
• Approximation Algorithms 25%
• Approximation Ratio 25%
• Permutation Symmetry 25%
• Permutation Group 25%
• Round numbers 25%
• Primary Barrier 25%
• Binary Programming 25%
• Minimum Makespan 25%
• Configuration Linear Program 25%
• Representation Theory of the Symmetric Group 25%
• Symmetry Breaking Inequalities 25%
• Polynomial-time Approximation Scheme 25%

Mathematics

• Sum of Squares 100%
• Symmetry Breaking 100%
• Linear Program 50%
• Polynomial 16%
• Permutation 16%
• Open Question 16%
• Worst Case 16%
• Analogous Result 16%
• Symmetric Group 16%
• Representation Theory 16%
• Permutation Group 16%
• Polynomial Time 16%
• Linear Programming 16%

Computer Science

• Linear Program 100%
• Convex Relaxation 33%
• Polynomial Complexity 33%
• Approximation Algorithms 33%
• Classical Problem 33%
• Time Approximation Scheme 33%
• Approximation Ratio 33%
• Minimum Makespan 33%
• Polynomial Time 33%
• Linear Programming 33%