A competitive analysis of the list update problem with lookahead

Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

5 Zitate (Scopus)

Abstract

We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if an on-line algorithm sees not only the present request to be served but also some future requests? We introduce two different models of lookahead and study the list update problem using these models. In addition to lower bounds we present a number of competitive on-line algorithms with lookahead.

OriginalspracheEnglisch
TitelMathematical Foundations of Computer Science 1994 - 19th International Symposium, MFCS 1994, Proceedings
Redakteure/-innenIgor Privara, Branislav Rovan, Peter Ruzicka
Herausgeber (Verlag)Springer Verlag
Seiten201-210
Seitenumfang10
ISBN (Print)9783540583387
DOIs
PublikationsstatusVeröffentlicht - 1994
Extern publiziertJa
Veranstaltung19th International Symposium on Mathematical Foundations of Computer Science, MFCS 1994 - Kosice, Slowakei
Dauer: 22 Aug. 199426 Aug. 1994

Publikationsreihe

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Band841 LNCS
ISSN (Print)0302-9743
ISSN (elektronisch)1611-3349

Konferenz

Konferenz19th International Symposium on Mathematical Foundations of Computer Science, MFCS 1994
Land/GebietSlowakei
OrtKosice
Zeitraum22/08/9426/08/94

Fingerprint

Untersuchen Sie die Forschungsthemen von „A competitive analysis of the list update problem with lookahead“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren