Near-Optimal Bounds for Online Caching with Machine Learned Advice

DOI10.1137/1.9781611975994.112OpenAlexW3001957700MaRDI QIDQ5146895

Dhruv Rohatgi

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.12172

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items

Learning-augmented algorithms for online subset sum, Online Metric Algorithms with Untrusted Predictions, Secretary and online matching problems with machine learned advice, Canadian traveller problem with predictions, Online interval scheduling with predictions, Unnamed Item, Machine learning advised algorithms for the ski rental problem with a discount