2 citations · 2 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Near-Optimal Consistency-Robustness Bounds for Non-Clairvoyant Scheduling
Sizhe Li, Nicolas Christianson, Tongxin Li
We study the problem of characterizing the optimal consistency--robustness tradeoff for single-machine non-clairvoyant scheduling with predicted processing times. For a fixed numbe…
cs.DS2025
Prediction-Specific Design of Learning-Augmented Algorithms
Sizhe Li, Nicolas Christianson, Tongxin Li
Algorithms with predictions} has emerged as a powerful framework to combine the robustness of traditional online algorithms with the data-driven performance benefits of machine-lea…