Optimal strategies for the list update problem under the MRM alternative cost model

DOI10.1016/j.ipl.2011.12.001zbMath1242.68378OpenAlexW2026266551MaRDI QIDQ437676

Alexander Golynski, Alejandro López-Ortiz

Publication date: 18 July 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.12.001

zbMATH Keywords

dynamic programmingonline algorithmslist update

Mathematics Subject Classification ID

Searching and sorting (68P10) Dynamic programming (90C39) Online algorithms; streaming algorithms (68W27)

Related Items (1)

A Survey of Algorithms and Models for List Update

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the competitiveness of the move-to-front rule
• Parameterized Analysis of Paging and List Update Algorithms
• On Serial Files with Relocatable Records
• List Update with Locality of Reference

This page was built for publication: Optimal strategies for the list update problem under the MRM alternative cost model