Online metric algorithms with untrusted predictions

A Antoniadis, C Coester, M Eliáš, A Polak… - ACM transactions on …, 2023 - dl.acm.org
Machine-learned predictors, although achieving very good results for inputs resembling
training data, cannot possibly provide perfect predictions in all situations. Still, decision …

Prophet secretary for combinatorial auctions and matroids

S Ehsani, MT Hajiaghayi, T Kesselheim… - Proceedings of the twenty …, 2018 - SIAM
The secretary and the prophet inequality problems are central to the field of Stop**
Theory. Recently, there has been a lot of work in generalizing these models to multiple items …

Optimal robustness-consistency tradeoffs for learning-augmented metrical task systems

N Christianson, J Shen… - … Conference on Artificial …, 2023 - proceedings.mlr.press
We examine the problem of designing learning-augmented algorithms for metrical task
systems (MTS) that exploit machine-learned advice while maintaining rigorous, worst-case …

A universal error measure for input predictions applied to online graph problems

G Bernardini, A Lindermayr… - Advances in …, 2022 - proceedings.neurips.cc
We introduce a novel measure for quantifying the error in input predictions. The error is
based on a minimum-cost hyperedge cover in a suitably defined hypergraph and provides a …

Random-Order Models.

A Gupta, S Singla - 2020 - books.google.com
This chapter introduces the random-order model in online algorithms. In this model, the input
is chosen by an adversary, then randomly permuted before being presented to the …

The online 𝑘-taxi problem

C Coester, E Koutsoupias - Proceedings of the 51st Annual ACM …, 2019 - dl.acm.org
We consider the online k-taxi problem, a generalization of the k-server problem, in which k
taxis serve a sequence of requests in a metric space. A request consists of two points s and …

Random order online set cover is as easy as offline

A Gupta, G Kehne, R Levin - 2021 IEEE 62nd Annual …, 2022 - ieeexplore.ieee.org
We give a polynomial-time algorithm for Online-SetCover with a competitive ratio of
O(\logmn) when the elements are revealed in random order, matching the best possible …

Efficient online clustering with moving costs

D Christou, S Skoulakis… - Advances in Neural …, 2023 - proceedings.neurips.cc
In this work we consider an online learning problem, called Online $ k $-Clustering with
Moving Costs, at which a learner maintains a set of $ k $ facilities over $ T $ rounds so as to …

Stochastic online metric matching

A Gupta, G Guruganesh, B Peng, D Wajc - arxiv preprint arxiv:1904.09284, 2019 - arxiv.org
We study the minimum-cost metric perfect matching problem under online iid arrivals. We
are given a fixed metric with a server at each of the points, and then requests arrive online …

Set covering with our eyes wide shut

A Gupta, G Kehne, R Levin - Proceedings of the 2024 Annual ACM-SIAM …, 2024 - SIAM
In the stochastic set cover problem (Grandoni et al., FOCS '08), we are given a collection S
of m sets over a universe U of size N, and a distribution D over elements of U. The algorithm …