
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


The author presents efficient algorithms for approximating geometric knapsack problems with near-linear running times, significantly improving existing methods.


Approximating-the-Geometric-Knapsack-Problem-in-Near-Linear-Time-and-Dynamically


Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically
