1 Hit in 7.8 sec

Caching with Time Windows and Delays [article]

Anupam Gupta and Amit Kumar and Debmalya Panigrahi
2020 arXiv   pre-print
We give O(log klog n)-competitive algorithms for both the PageTW and PageD problems on n pages with a cache of size k.  ...  To the best of our knowledge, this is the first example of an LP-based algorithm for an online algorithm with delays/deadlines.  ...  This research was done under the auspices of the Indo-US Virtual Networked Joint Center IUSSTF/JC-017/2017. AG was supported in part by NSF award CCF-1907820.  ... 
arXiv:2006.09665v1 fatcat:l7l2vezfq5hulewm45y54iyyr4