✦ LIBER ✦

A combined BIT and TIMESTAMP algorithm for the list update problem

✍ Scribed by Susanne Albers; Bernhard von Stengel; Ralph Werchner

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 477 KB
Volume: 56
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(95)00142-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A combined algorithm for weighting the v

A combined algorithm for weighting the variables and clustering in the clustering problem

✍ Vladimir J. Lumelsky 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 554 KB

Parallel Algorithms for the Edge-Colorin

Parallel Algorithms for the Edge-Coloring and Edge-Coloring Update Problems

✍ Weifa Liang; Xiaojun Shen; Qing Hu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 342 KB

In fact, Vizing's proof implies an O(nm) time algorithm with ⌬ ϩ 1 colors for the edge-coloring problem. However, Holyer has shown that deciding whether a graph requires ⌬ or ⌬ ϩ 1 colors is NP-complete [10]. For a multigraph G, Shannon showed that Ј(G) Յ 3⌬/2 [16]. A number of parallel algorithms

Stress update algorithm for the combined

Stress update algorithm for the combined viscoplastic and plastic behaviours of single-crystal superalloys

✍ Vitaliy Kindrachuk; Bernard Fedelich 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 424 KB

Computational implementation of a combin

Computational implementation of a combined branch and bound algorithm for the travelling-salesman problem

✍ I.Kh. Sigal 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 588 KB

An Accelerative Enumeration Algorithm fo

An Accelerative Enumeration Algorithm for the Bottle Combination Problem and the Menu Planning Problem

✍ Harukazu Tsuruta; Noriaki Ikeda; Toshiro Sato 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 513 KB

A branch-and-cut algorithm for the preem

A branch-and-cut algorithm for the preemptive swapping problem

✍ Charles Bordenave; Michel Gendreau; G. Laporte 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 247 KB 👁 1 views

## Abstract In the swapping problem (SP), every vertex of a complete graph may supply and demand an object of a known type. A vehicle of unit capacity starting and ending its tour at an arbitrary vertex is available for carrying objects of given types between vertices. The SP consists of determinin