Abstract
In this paper we present some deterministic and randomized algorithms for the Weight List Update Problem. In this framework a cost (weight) is associated to each item. The algorithms consist in modifying the well known Move-To-Front heuristic by adding randomness or counters in order to decide whether moving the accessed item. We prove that Random Move-To-Front and Counting Move-To-Front are 2-competitive against any static adversary, and that deterministic Move-To-Front does not share this property. We apply this approach to the management of non-modifiable trees by means of lists of successors proving that 2-competitivity property still holds.
Work supported by the ESPRIT II Basic Research Actions Program Project no. 3075 (“ALCOM”) and by the Italian MPI National Project “Algoritmi e Strutture di Calcolo”.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
J. L. Bentley, and C. McGeogh, Amortized Analyses of Self-Organizing Sequential Search Heuristics, Communications of the ACM 28, 4 (April 1985), 404–411.
J. R. Bitner, Heuristics that Dynamically Organize Data Structures, SIAM J. of Computing 8, 1 (February 1979), 82–110.
S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Wigderson, On the Power of Randomization in Online Algorithms, in Proceedings of the 20th ACM Annual Symposium on Theory of Computing, May 1990, 379–386.
F. d'Amore, U. Nanni, and A. Marchetti-Spaccamela, Robust Algorithms for Diagnosis, Technical Report, Dipartimento di Informatica e Sistemistica, Univ. of Roma “La Sapienza”, 1991.
S. Gnesi, U. Montanari, and A. Martelli, Dynamic programming as graph searching: An algebraic approach, Journal of ACM 28, (1981), 737–751.
J. H. Hester, and D. S. Hirschberg, Self-Organizing Linear Search, ACM Computing Surveys 17, 3 (September 1985), 295–311.
S. Irani, N. Reingold, J. Westbrook, and D. D. Sleator, Randomized Competitive Algorithms for the List Update Problem, in Proceedings of the 2nd ACM-SIAM Annual Symposium on Discrete Algorithms, San Francisco, CA, January 1991, 251–260.
S. Irani, Two Results on the List Update Problem, Technical Report TR-90-037, Computer Science Division, U.C. Berkeley, California, August 1990.
M. S. Manasse, L. A. McGeoch, and D. D. Sleator, Competitive Algorithms for Online Problems, in Proceedings of the 18th ACM Annual Symposium on Theory of Computing, May 1988, 322–333.
N. J. Nilsson, Principles of Artificial Intelligence, Springer Verlag, (1982).
R. Reiter, A Theory of Diagnosis from First Principles, Artificial Intelligence 32, (1987), 57–95.
R. Rivest, On Self-Organizing Sequential Search Heuristics, Communications of the ACM 19, 2 (February 1976), 63–67.
D. D. Sleator, and R. E. Tarjan, Amortized Efficiency of List Update and Paging Rules, Communications of the ACM 28, 2 (February 1985), 202–208.
R. E. Tarjan, Amortized Computational Complexity, SIAM J. Alg. Disc. Meth. 6, 2 (April 1985), 306–318.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
d'Amore, F., Marchetti-Spaccamela, A., Nanni, U. (1991). Competitive algorithms for the weighted list update problem. In: Dehne, F., Sack, JR., Santoro, N. (eds) Algorithms and Data Structures. WADS 1991. Lecture Notes in Computer Science, vol 519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028266
Download citation
DOI: https://doi.org/10.1007/BFb0028266
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54343-5
Online ISBN: 978-3-540-47566-8
eBook Packages: Springer Book Archive