Boosting Double Coverage for k-Server via Imperfect Predictions

We study the online k -server problem in a learning-augmented setting. While in the traditional online model, an algorithm has no information about the request sequence, we assume that there is given some advice (for example, machine-learned predictions) on an algorithm’s decision. There is, however...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 87; číslo 11; s. 1477 - 1517
Hlavní autori:	Lindermayr, Alexander, Megow, Nicole, Simon, Bertrand
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.11.2025 Springer Nature B.V Springer Verlag
Predmet:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Lower bounds Machine learning Mathematics of Computing Theory of Computation Learning-augmented algorithms Online k-server problem Competitive analysis Consistency Robustness Advice Imperfect predictions
ISSN:	0178-4617, 1432-0541
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!