Caching documents with variable sizes and fetching costs: an LP-based approach

DOI10.1007/S00453-001-0081-ZMaRDI QIDQ1348944zbMATH OpenOpenAlexFDO

Authors Edith Cohen, Haim Kaplan

Publication date 21 May 2002

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-001-0081-z

zbMATH Keywords

linear programminginteger programminggeneralized caching problem

Mathematics Subject Classification ID

Linear programming (90C05) Nonnumerical algorithms (68W05) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 1305498
• scientific article; zbMATH DE number 1305389
• scientific article; zbMATH DE number 1559590
• An \(O(\log k)\)-competitive algorithm for generalized caching
• Page replacement with multi-size pages and applications to web caching

Cited in

(2)

• Online file caching with rejection penalties
• On variants of file caching

This page was built for publication: Caching documents with variable sizes and fetching costs: an LP-based approach

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