An O(log k)-competitive algorithm for generalized caching

Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke

Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

25 Zitate (Scopus)

Abstract

In the generalized caching problem, we have a set of pages and a cache of size k. Each page p has a size wp ≥ 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 cp. 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.

OriginalspracheEnglisch
TitelProceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012
Herausgeber (Verlag)Association for Computing Machinery
Seiten1681-1689
Seitenumfang9
ISBN (Print)9781611972108
DOIs
PublikationsstatusVeröffentlicht - 2012
Veranstaltung23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012 - Kyoto, Japan
Dauer: 17 Jan. 201219 Jan. 2012

Publikationsreihe

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Konferenz

Konferenz23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012
Land/GebietJapan
OrtKyoto
Zeitraum17/01/1219/01/12

Fingerprint

Untersuchen Sie die Forschungsthemen von „An O(log k)-competitive algorithm for generalized caching“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren