Improving worst-case approximation ratios for the MaxCut problem using noisy and partial predictions.
The author presents efficient algorithms for approximating geometric knapsack problems with near-linear running times, significantly improving existing methods.