
Improving worst-case approximation ratios for the MaxCut problem using noisy and partial predictions.


coremsg

max-cut-with-ε-accurate-predictions-improving-approximation-ratios


Max-Cut with ε-Accurate Predictions: Improving Approximation Ratios


title_rewrite


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.


lift-and-project-integrality-gaps-for-the-maxmindegree-arborescence-problem


Lift-and-Project Integrality Gaps for the MaxMinDegree Arborescence Problem
