Document Open Access Logo

A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs

Authors Mateusz Basiak , Marcin Bienkowski , Martin Böhm , Marek Chrobak , Łukasz Jeż , Jiří Sgall , Agnieszka Tatarczuk

PDF

File

Thumbnail PDF
PDF
LIPIcs.ESA.2025.76.pdf
  • Filesize: 0.87 MB
  • 15 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Online algorithms
Keywords
  • List update
  • work functions
  • amortized analysis
  • online algorithms
  • competitive analysis

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We consider the List Update problem where the cost of each swap is assumed to be 1. This is in contrast to the "standard" model, in which an algorithm is allowed to swap the requested item with previous items for free. We construct an online algorithm Full-Or-Partial-Move (FPM), whose competitive ratio is at most 3.3904, improving over the previous best known bound of 4.

Cite As Get BibTex

Mateusz Basiak, Marcin Bienkowski, Martin Böhm, Marek Chrobak, Łukasz Jeż, Jiří Sgall, and Agnieszka Tatarczuk. A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs. In 33rd Annual European Symposium on Algorithms (ESA 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 351, pp. 76:1-76:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ESA.2025.76

Author Details

Mateusz Basiak
  • University of Wrocław, Poland
Marcin Bienkowski
  • University of Wrocław, Poland
Martin Böhm
  • University of Wrocław, Poland
Marek Chrobak
  • University of California, Riverside, CA, USA
Łukasz Jeż
  • University of Wrocław, Poland
Jiří Sgall
  • Charles University, Prague, Czech Republic
Agnieszka Tatarczuk
  • University of Wrocław, Poland

Funding

Suppported by Polish National Science Centre grants 2022/45/B/ST6/00559, 2020/39/B/ST6/01679 and 2022/47/D/ST6/02864, National Science Foundation grant CCF-2153723, and by grant 24-10306S of GA ČR.

References

  1. Susanne Albers. A competitive analysis of the list update problem with lookahead. Theoretical Computer Science, 197(1):95-109, 1998. URL: https://doi.org/10.1016/S0304-3975(97)00026-1.
  2. Susanne Albers. Improved randomized on-line algorithms for the list update problem. SIAM Journal on Computing, 27(3):682-693, 1998. URL: https://doi.org/10.1137/S0097539794277858.
  3. Susanne Albers. Online list update. In Encyclopedia of Algorithms, pages 598-601. Springer, 2008. URL: https://doi.org/10.1007/978-0-387-30162-4_266.
  4. Susanne Albers and Maximilian Janke. New bounds for randomized list update in the paid exchange model. In 37th Int. Symposium on Theoretical Aspects of Computer Science (STACS), pages 12:1-12:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. URL: https://doi.org/10.4230/LIPICS.STACS.2020.12.
  5. Susanne Albers and Sonja Lauer. On list update with locality of reference. Journal of Computer and System Sciences, 82(5):627-653, 2016. URL: https://doi.org/10.1016/J.JCSS.2015.11.005.
  6. Susanne Albers, Bernhard Von Stengel, and Ralph Werchner. A combined BIT and TIMESTAMP algorithm for the list update problem. Information Processing Letters, 56(3):135-139, 1995. URL: https://doi.org/10.1016/0020-0190(95)00142-Y.
  7. Susanne Albers and Jeffery Westbrook. Self-organizing data structures. In Online Algorithms, The State of the Art, pages 13-51. Springer, 1996. URL: https://doi.org/10.1007/BFb0029563.
  8. Christoph Ambühl, Bernd Gärtner, and Bernhard von Stengel. Optimal lower bounds for projective list update algorithms. ACM Transactions on Algorithms, 9(4):1-18, 2013. URL: https://doi.org/10.1145/2500120.
  9. Eric J. Anderson, Kirsten Hildrum, Anna R. Karlin, April Rasala, and Michael E. Saks. On list update and work function algorithms. In Proc. 7th Annual European Symposium on Algorithms (ESA), pages 289-300. Springer, 1999. URL: https://doi.org/10.1007/3-540-48481-7_26.
  10. Spyros Angelopoulos, Reza Dorrigiv, and Alejandro López-Ortiz. List update with locality of reference. In Proc. 8th Latin American Symposium on Theoretical Informatics (LATIN), pages 399-410. Springer, 2008. URL: https://doi.org/10.1007/978-3-540-78773-0_35.
  11. Yossi Azar, Shahar Lewkowicz, and Varun Suriyanarayana. List update with prediction. In AAAI Conference on Artificial Intelligence (AAAI), pages 15436-15444. AAAI Press, 2025. URL: https://doi.org/10.1609/AAAI.V39I15.33694.
  12. Yossi Azar, Shahar Lewkowicz, and Danny Vainstein. List update with delays or time windows. In Proc. 51st Int. Colloqium on Automata, Languages, and Programming (ICALP), pages 15:1-15:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/LIPICS.ICALP.2024.15.
  13. Ran Bachrach, Ran El-Yaniv, and M. Reinstadtler. On the competitive theory and practice of online list accessing algorithms. Algorithmica, 32(2):201-245, 2002. URL: https://doi.org/10.1007/S00453-001-0069-8.
  14. Mateusz Basiak, Marcin Bienkowski, Martin Böhm, Marek Chrobak, Łukasz Jeż, Jiří Sgall, and Agnieszka Tatarczuk. A 3.3904-competitive online algorithm for list update with uniform costs. https://arxiv.org/abs/2503.17264. Full version.
  15. Jon L. Bentley and Catherine C. McGeoch. Amortized analyses of self-organizing sequential search heuristics. Communications of the ACM, 28(4):404-411, 1985. URL: https://doi.org/10.1145/3341.3349.
  16. Joan Boyar, Shahin Kamali, Kim S. Larsen, and Alejandro López-Ortiz. On the list update problem with advice. Information and Computation, 253:411-423, 2017. URL: https://doi.org/10.1016/J.IC.2016.06.007.
  17. Reza Dorrigiv, Martin R Ehmsen, and Alejandro López-Ortiz. Parameterized analysis of paging and list update algorithms. Algorithmica, 71(2):330-353, 2015. URL: https://doi.org/10.1007/S00453-013-9800-5.
  18. Alexander Golynski and Alejandro López-Ortiz. Optimal strategies for the list update problem under the MRM alternative cost model. Information Processing Letters, 112(6):218-222, 2012. URL: https://doi.org/10.1016/J.IPL.2011.12.001.
  19. Sandy Irani. Two results on the list update problem. Information Processing Letters, 38(6):301-306, 1991. URL: https://doi.org/10.1016/0020-0190(91)90086-W.
  20. Shahin Kamali. Online list update. In Encyclopedia of Algorithms, pages 1448-1451. Springer, 2016. URL: https://doi.org/10.1007/978-1-4939-2864-4_266.
  21. Shahin Kamali and Alejandro López-Ortiz. A Survey of Algorithms and Models for List Update, pages 251-266. Springer, 2013. URL: https://doi.org/10.1007/978-3-642-40273-9_17.
  22. Conrado Martınez and Salvador Roura. On the competitiveness of the move-to-front rule. Theoretical Computer Science, 242(1-2):313-325, 2000. URL: https://doi.org/10.1016/S0304-3975(98)00264-3.
  23. J. Ian Munro. On the competitiveness of linear search. In Proc. 8th Annual European Symposium on Algorithms (ESA), pages 338-345. Springer, 2000. URL: https://doi.org/10.1007/3-540-45253-2_31.
  24. Nick Reingold, Jeffery Westbrook, and Daniel D Sleator. Randomized competitive algorithms for the list update problem. Algorithmica, 11(1):15-32, 1994. URL: https://doi.org/10.1007/BF01294261.
  25. Daniel D. Sleator and Robert E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28(2):202-208, 1985. URL: https://doi.org/10.1145/2786.2793.
  26. Boris Teia. A lower bound for randomized list update algorithms. Information Processing Letters, 47(1):5-9, 1993. URL: https://doi.org/10.1016/0020-0190(93)90150-8.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact