Improving worst-case approximation ratios for the MaxCut problem using noisy and partial predictions.
This paper demonstrates the limitations of lift-and-project methods, particularly the Sherali-Adams hierarchy, in approximating solutions to the MaxMinDegree Arborescence (MMDA) problem, a special case of the Santa Claus problem.