An O(log k)-competitive algorithm for generalized caching
Adamaszek, Anna, Czumaj, Artur, Englert, Matthias and Räcke, Harald (2012) An O(log k)-competitive algorithm for generalized caching. In: 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, 17-19 Jan 2012. Published in: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms pp. 1681-1689.Full text not available from this repository.
In the generalized caching problem, we have a set of pages and a cache of size k. Each page p has a size w p ≥ 1 and fetching cost c p for loading the page into the cache. At any point in time, the sum of the sizes of the pages stored in the cache cannot exceed k. The input consists of a sequence of page requests. If a page is not present in the cache at the time it is requested, it has to be loaded into the cache incurring a cost of c p. We give a randomized O(log k)-competitive online algorithm for the generalized caching problem, improving the previous bound of O(log 2 k) by Bansal, Buchbinder, and Naor (STOC'08). This improved bound is asymptotically tight and of the same order as the known bounds for the classic problem with uniform weights and sizes. We follow the LP based techniques proposed Bansal et al. and our main contribution are improved and slightly simplified methods for rounding fractional solutions online. Copyright © SIAM.
|Item Type:||Conference Item (Paper)|
|Divisions:||Faculty of Science > Computer Science|
|Journal or Publication Title:||Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms|
|Page Range:||pp. 1681-1689|
|Access rights to Published version:||Restricted or Subscription Access|
|Conference Paper Type:||Paper|
|Title of Event:||23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012|
|Type of Event:||Conference|
|Location of Event:||Kyoto, Japan|
|Date(s) of Event:||17-19 Jan 2012|
Actions (login required)