Showing cs.LGShow all
2 papers · 1 filter
cs.LG2025
Near-Optimal Consistency-Robustness Trade-Offs for Learning-Augmented Online Knapsack Problems
Mohammadreza Daneshvaramoli, Helia Karisani, Adam Lechowicz +3
This paper introduces a family of learning-augmented algorithms for online knapsack problems that achieve near Pareto-optimal consistency-robustness trade-offs through a simple com…
cs.LG2024
Time Fairness in Online Knapsack Problems
Adam Lechowicz, Rik Sengupta, Bo Sun +2
The online knapsack problem is a classic problem in the field of online algorithms. Its canonical version asks how to pack items of different values and weights arriving online int…