A proof of the optimality of the MIN paging algorithm using linear programming duality

DOI10.1016/0167-6377(95)00021-BzbMath0857.90079OpenAlexW1985049706MaRDI QIDQ1924620

Ariel Cohen, Walter A. Burkhard

Publication date: 20 October 1996

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(95)00021-b

zbMATH Keywords

dualityanalysis of algorithmsassignment problempaging

Mathematics Subject Classification ID

Linear programming (90C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A strongly competitive randomized paging algorithm
• Competitive paging algorithms

This page was built for publication: A proof of the optimality of the MIN paging algorithm using linear programming duality