2 citations · 4 across the 6 of their papers we have counts for
6 papers
TSP with Predictions: Heatmap to Tour with Provable Guarantees
Marek Eliáš, Fabrizio Grandoni, Adam Polak +1
The Traveling Salesperson Problem (TSP) has long served as a benchmark for evaluating the strength of optimization techniques in the classical theory of algorithms. In recent effor…
Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors
Matei Gabriel Coşa, Marek Eliáš
We consider the following problem: We are given heuristics for Metrical Task Systems (MTS), where each might be tailored to a different type of input instances. While proces…
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…