Skip to main content
Log in

Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach

Algorithmica Aims and scope Submit manuscript

Abstract

We give an integer programming formulation of the paging problem with varying sizes and fetching costs. We use this formulation to provide an alternative proof that a variant of the algorithm greedy-dual-size previously considered in [4] and [5] is (k+1)/(k-h+1)competitive against the optimal strategy with cache size h≤ k . Our proof provides further insights to greedy-dual-size. We also indicate how the same integer programming formulation has been recently used [1], [2] to obtain approximation algorithms to the NP-complete ``offline'' problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cohen, Kaplan Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach . Algorithmica 32, 459–466 (2002). https://doi.org/10.1007/s00453-001-0081-z

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-001-0081-z

Navigation