✦ LIBER ✦

On lookahead in the list update problem

✍ Scribed by Rahul Simha; Amitava Majumdar

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 593 KB
Volume: 50
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(94)00014-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 weighted list update problem and the

The weighted list update problem and the lazy adversary

✍ Fabrizio d'Amore; Alberto Marchetti-Spaccamela; Umberto Nanni 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 1019 KB

A combined BIT and TIMESTAMP algorithm f

A combined BIT and TIMESTAMP algorithm for the list update problem

✍ Susanne Albers; Bernhard von Stengel; Ralph Werchner 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 477 KB

Update on the no-three-in-line problem

✍ David Brent Anderson 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 105 KB

On the power of lookahead in online lot-

On the power of lookahead in online lot-sizing

✍ Lauri Ahlroth; André Schumacher; Harri Haanpää 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 262 KB

A note on the problem of updating shorte

A note on the problem of updating shortest paths

✍ Satoru Fujishige 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB 👁 1 views