Similar Items: Learning-Augmented Scalable Linear Assignment Problem Optimization via Neural Dual Warm-Starts
- Optimal Learning-Augmented Algorithm for Online Bidding
- Handicap reduction for linear complementarity problems
- On Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds in the MPC Model
- The Pareto Frontier of Randomized Learning-Augmented Online Bidding
- A Scalable and Unified Framework to Weighted Rank Aggregation
- The Impossibility of Simultaneous Time and I/O Optimality for The Planar Maxima and Convex Hull Problems