On list update and work function algorithms

The list update problem, a well-studied problem in dynamic data structures, can be described abstractly as a metrical task system. In this paper, we prove that a generic metrical task system algorithm, called the work function algorithm, has constant competitive ratio for list update. In the process...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 287; no. 2; pp. 393 - 418
Main Authors Anderson, Eric J., Hildrum, Kirsten, Karlin, Anna R., Rasala, April, Saks, Michael
Format Journal Article Conference Proceeding
LanguageEnglish
Published Amsterdam Elsevier B.V 28.09.2002
Elsevier
Subjects
Applied sciences
Computer science; control theory; systems
Data processing. List processing. Character string processing
Exact sciences and technology
Memory organisation. Data processing
Software
Partial ordering
Work function
Data structure
Competitive algorithms
Deterministic algorithms
Online AccessGet full text

Cover

More Information
Summary:The list update problem, a well-studied problem in dynamic data structures, can be described abstractly as a metrical task system. In this paper, we prove that a generic metrical task system algorithm, called the work function algorithm, has constant competitive ratio for list update. In the process, we present a new formulation of the well-known “list factoring” technique in terms of a partial order on the elements of the list. This approach leads to a new simple proof that a large class of online algorithms, including Move-To-Front, is (2−1/k)-competitive, for k the list length.
Bibliography:SourceType-Scholarly Journals-2
ObjectType-Feature-2
ObjectType-Conference Paper-1
content type line 23
SourceType-Conference Papers & Proceedings-1
ObjectType-Article-3
ISSN:0304-3975
1879-2294
DOI:10.1016/S0304-3975(01)00253-5