2 citations · 4 across the 6 of their papers we have counts for
4 papers · 1 filter
Approximation Algorithms for Combinatorial Optimization with Predictions
Antonios Antoniadis, Marek Eliáš, Adam Polak +1
We initiate a systematic study of utilizing predictions to improve over approximation guarantees of classic algorithms, without increasing the running time. We propose a systematic…
Stronger adversaries grow cheaper forests: online node-weighted Steiner problems
Sander Borst, Marek Eliáš, Moritz Venzin
We propose a -competitive randomized algorithm for online node-weighted Steiner forest. This is essentially optimal and significantly improves over the previous b…
Algorithms for Caching and MTS with reduced number of predictions
Karim Abdel Sadek, Marek Elias
ML-augmented algorithms utilize predictions to achieve performance beyond their worst-case bounds. Producing these predictions might be a costly operation -- this motivated Im et a…
Learning-Augmented Algorithms with Explicit Predictors
Marek Elias, Haim Kaplan, Yishay Mansour +1
Recent advances in algorithmic design show how to utilize predictions obtained by machine learning models from past and present data. These approaches have demonstrated an enhancem…