サインイン
インサイト - Algorithm Design
Max-Cut with ε-Accurate Predictions: Improving Approximation Ratios
Improving worst-case approximation ratios for the MaxCut problem using noisy and partial predictions.
Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically
The author presents efficient algorithms for approximating geometric knapsack problems with near-linear running times, significantly improving existing methods.
