3 papers
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.DS2025
Learning-Augmented Competitive Algorithms for Spatiotemporal Online Allocation with Deadline Constraints
Adam Lechowicz, Nicolas Christianson, Bo Sun +4
We introduce and study spatiotemporal online allocation with deadline constraints (), a new online problem motivated by emerging challenges in sustainability and ene…
cs.DS2024
Online Conversion with Switching Costs: Robust and Learning-Augmented Algorithms
Adam Lechowicz, Nicolas Christianson, Bo Sun +4
We introduce and study online conversion with switching costs, a family of online problems that capture emerging problems at the intersection of energy and sustainability. In this…