1 citations · 1 across the 1 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2024★ 1 cited
Comparing the Hardness of Online Minimization and Maximization Problems with Predictions
Magnus Berg
We build on the work of Berg, Boyar, Favrholdt, and Larsen, who developed a complexity theory for online problems with and without predictions (IJTCS-FAW, volume 15828 of LNCS, Spr…
cs.DS2024
Complexity Classes for Online Problems with and without Predictions
Magnus Berg, Joan Boyar, Lene M. Favrholdt +1
With the developments in machine learning, there has been a surge in interest and results focused on algorithms utilizing predictions, not least in online algorithms where most new…