✦ LIBER ✦

The ring route problem

✍ Scribed by I. S. Sakunova; N. V. Yarovitskii

Book ID: 105057221
Publisher: Springer US
Year: 1975
Tongue: English
Weight: 443 KB
Volume: 9
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01069210

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal-Algorithms for Multipacket Routi

Optimal-Algorithms for Multipacket Routing Problems on Rings

✍ F. Makedon; A. Symvonis 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 643 KB

We study multipacket routing problems on rings of processors. We prove a new lower bound of \(2 n / 3\) routing steps for the case that \(k\), the number of packets per processor, is at most 2 . We also give an algorithm that tightens this lower bound. For the case where \(k>2\), the lower bound is

The zookeeper route problem

✍ Chin Wei-Pang; Simeon Ntafos 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 985 KB

The robber route problem

✍ Simeon Ntafos 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 454 KB

Nearest Route Problem

✍ Seiichi Iwamoto 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 139 KB

In this paper we propose a new class of optimization problems on oriented graphs with weight, which are called nearest route problems. A nearest problem has a target value, which generates an error function in a sense. Which route is nearest to the designated value? The nearest route problem include

The ring grooming problem

✍ Timothy Y. Chow; Philip J. Lin 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB

The period routing problem

✍ N. Christofides; J. E. Beasley 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 726 KB