Caching Is Hard – Even in the Fault Model

DOI10.1007/978-3-642-15775-2_17zbMath1287.68054OpenAlexW1846413446MaRDI QIDQ3586462

Gerhard J. Woeginger, Kazuhisa Makino, Hai-Feng Xu, Marek Chrobak

Publication date: 6 September 2010

Published in: Algorithms – ESA 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15775-2_17

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Theory of operating systems (68N25)

Related Items (2)

Fixed-parameter algorithms for unsplittable flow cover ⋮ On Variants of File Caching

This page was built for publication: Caching Is Hard – Even in the Fault Model