๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The weighted list update problem and the lazy adversary

โœ Scribed by Fabrizio d'Amore; Alberto Marchetti-Spaccamela; Umberto Nanni

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
1019 KB
Volume
108
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On lookahead in the list update problem
On lookahead in the list update problem
โœ Rahul Simha; Amitava Majumdar ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 593 KB
Off-line algorithms for the list update
Off-line algorithms for the list update problem
โœ Nick Reingold; Jeffery Westbrook ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 637 KB

Optimum off-line algorithms for the list update problem are investigated. The list update problem involves implementing a dictionary of items as a linear list. Several characterizations of optimum algorithms are given; these lead to optimum algorithm which runs in time 02"( n -1) !m, where n is the

The searchlight guarding problem on weig
The searchlight guarding problem on weighted split graphs and weighted cographs
โœ Yen, William C. K.; Tang, C. Y. ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 223 KB ๐Ÿ‘ 2 views

This paper addresses the searchlight guarding problem, which is an extension of so-called graph searching/guarding problem on a weighted, undirected graph G by considering the time-slot parameter in addition to the traditional building cost. Given a weighted, undirected graph G G G, suppose that the