Competitive algorithms for restricted caching and matroid caching

Niv Buchbinder; Shahar Chen; Joseph Naor

doi:10.1007/978-3-662-44777-2_18

Competitive algorithms for restricted caching and matroid caching

Niv Buchbinder
, Shahar Chen
, Joseph Naor

Tel Aviv University, Technion - Israel Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We study the online restricted caching problem, where each memory item can be placed in only a restricted subset of cache locations. We solve this problem through a more general online caching problem in which the cache is subject to matroid constraints. Our main result is an O(min {d,logr} ·logc)- competitive algorithm for the matroid caching problem, where r and c are the rank and circumference of the matroid, and d is the diameter of an auxiliary graph defined over it. In general, this result guarantees an O(log² k)-competitiveness for any restricted cache of size k, independently of its structure. In addition, we study the special case of the (n,l)-companion caching problem [8]. For companion caching we prove that our algorithm achieves an optimal competitive factor of O(logn+logl), improving on previous results of [18].

Original language	English
Title of host publication	Algorithms, ESA 2014 - 22nd Annual European Symposium, Proceedings
Publisher	Springer Verlag
Pages	209-221
Number of pages	13
ISBN (Print)	9783662447765
DOIs	https://doi.org/10.1007/978-3-662-44777-2_18
State	Published - 2014
Event	22nd Annual European Symposium on Algorithms, ESA 2014 - Wroclaw, Poland Duration: 8 Sep 2014 → 10 Sep 2014

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8737 LNCS

Conference

Conference	22nd Annual European Symposium on Algorithms, ESA 2014
Country/Territory	Poland
City	Wroclaw
Period	8/09/14 → 10/09/14

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-662-44777-2_18

Cite this

Buchbinder, N., Chen, S., & Naor, J. (2014). Competitive algorithms for restricted caching and matroid caching. In Algorithms, ESA 2014 - 22nd Annual European Symposium, Proceedings (pp. 209-221). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8737 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-662-44777-2_18

@inproceedings{6a9e8c20496a42b29bae1552f1e48b37,

title = "Competitive algorithms for restricted caching and matroid caching",

abstract = "We study the online restricted caching problem, where each memory item can be placed in only a restricted subset of cache locations. We solve this problem through a more general online caching problem in which the cache is subject to matroid constraints. Our main result is an O(min \{d,logr\} ·logc)- competitive algorithm for the matroid caching problem, where r and c are the rank and circumference of the matroid, and d is the diameter of an auxiliary graph defined over it. In general, this result guarantees an O(log2 k)-competitiveness for any restricted cache of size k, independently of its structure. In addition, we study the special case of the (n,l)-companion caching problem [8]. For companion caching we prove that our algorithm achieves an optimal competitive factor of O(logn+logl), improving on previous results of [18].",

author = "Niv Buchbinder and Shahar Chen and Joseph Naor",

year = "2014",

doi = "10.1007/978-3-662-44777-2\_18",

language = "الإنجليزيّة",

isbn = "9783662447765",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "209--221",

booktitle = "Algorithms, ESA 2014 - 22nd Annual European Symposium, Proceedings",

address = "ألمانيا",

note = "22nd Annual European Symposium on Algorithms, ESA 2014 ; Conference date: 08-09-2014 Through 10-09-2014",

}

Buchbinder, N, Chen, S & Naor, J 2014, Competitive algorithms for restricted caching and matroid caching. in Algorithms, ESA 2014 - 22nd Annual European Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8737 LNCS, Springer Verlag, pp. 209-221, 22nd Annual European Symposium on Algorithms, ESA 2014, Wroclaw, Poland, 8/09/14. https://doi.org/10.1007/978-3-662-44777-2_18

Competitive algorithms for restricted caching and matroid caching. / Buchbinder, Niv; Chen, Shahar; Naor, Joseph.
Algorithms, ESA 2014 - 22nd Annual European Symposium, Proceedings. Springer Verlag, 2014. p. 209-221 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8737 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Competitive algorithms for restricted caching and matroid caching

AU - Buchbinder, Niv

AU - Chen, Shahar

AU - Naor, Joseph

PY - 2014

Y1 - 2014

N2 - We study the online restricted caching problem, where each memory item can be placed in only a restricted subset of cache locations. We solve this problem through a more general online caching problem in which the cache is subject to matroid constraints. Our main result is an O(min {d,logr} ·logc)- competitive algorithm for the matroid caching problem, where r and c are the rank and circumference of the matroid, and d is the diameter of an auxiliary graph defined over it. In general, this result guarantees an O(log2 k)-competitiveness for any restricted cache of size k, independently of its structure. In addition, we study the special case of the (n,l)-companion caching problem [8]. For companion caching we prove that our algorithm achieves an optimal competitive factor of O(logn+logl), improving on previous results of [18].

AB - We study the online restricted caching problem, where each memory item can be placed in only a restricted subset of cache locations. We solve this problem through a more general online caching problem in which the cache is subject to matroid constraints. Our main result is an O(min {d,logr} ·logc)- competitive algorithm for the matroid caching problem, where r and c are the rank and circumference of the matroid, and d is the diameter of an auxiliary graph defined over it. In general, this result guarantees an O(log2 k)-competitiveness for any restricted cache of size k, independently of its structure. In addition, we study the special case of the (n,l)-companion caching problem [8]. For companion caching we prove that our algorithm achieves an optimal competitive factor of O(logn+logl), improving on previous results of [18].

UR - https://www.scopus.com/pages/publications/84958553673

U2 - 10.1007/978-3-662-44777-2_18

DO - 10.1007/978-3-662-44777-2_18

M3 - منشور من مؤتمر

SN - 9783662447765

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 209

EP - 221

BT - Algorithms, ESA 2014 - 22nd Annual European Symposium, Proceedings

PB - Springer Verlag

T2 - 22nd Annual European Symposium on Algorithms, ESA 2014

Y2 - 8 September 2014 through 10 September 2014

ER -

Buchbinder N, Chen S, Naor J. Competitive algorithms for restricted caching and matroid caching. In Algorithms, ESA 2014 - 22nd Annual European Symposium, Proceedings. Springer Verlag. 2014. p. 209-221. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-662-44777-2_18

Competitive algorithms for restricted caching and matroid caching

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this