1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.LG2025
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…
cs.DS2024★ 1 cited
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…
cs.DS2024
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…