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...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 87; no. 11; pp. 1477 - 1517
Main Authors:	Lindermayr, Alexander, Megow, Nicole, Simon, Bertrand
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.11.2025 Springer Nature B.V Springer Verlag
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!