Caching is hard -- even in the fault model

DOI10.1007/978-3-642-15775-2_17MaRDI QIDQ3586462zbMATH OpenOpenAlexFDO

Authors Gerhard J. Woeginger, Kazuhisa Makino, Haifeng 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

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

Recommendations

• Caching is hard -- even in the fault model
• scientific article; zbMATH DE number 1305389
• Page replacement with multi-size pages and applications to web caching

Cited in

(6)

• Fixed-parameter algorithms for unsplittable flow cover
• How to Poison Your Mother-in-Law, and Other Caching Problems
• On variants of file caching
• On the approximability of unsplittable flow on a path with time windows
• Caching is hard -- even in the fault model
• Unsplittable flow on a short path

This page was built for publication: Caching is hard -- even in the fault model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586462)