サインイン
インサイト - Approximation Algorithms
Max-Cut with ε-Accurate Predictions: Improving Approximation Ratios
Improving worst-case approximation ratios for the MaxCut problem using noisy and partial predictions.
Lift-and-Project Integrality Gaps for the MaxMinDegree Arborescence Problem
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.
