𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal algorithms for the many-to-one routing problem on two-dimensional meshes

✍ Scribed by Fillia Makedon; Antonios Symvonis

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
749 KB
Volume
17
Category
Article
ISSN
0141-9331

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

Two exact algorithms for the vehicle rou
Two exact algorithms for the vehicle routing problem on trees
✍ Pontien Mbaraga; AndrΓ© Langevin; Gilbert Laporte πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 80 KB πŸ‘ 2 views

This article describes a heuristic and two exact algorithms for several classes of vehicle routing problems defined on tree networks. These include capacitated and time-constrained vehicle routing problems. One of the exact algorithms is based on the computation of bin packing lower bounds. The othe

Optimal Algorithms for All-to-All Person
Optimal Algorithms for All-to-All Personalized Communication on Rings and Two Dimensional Tori
✍ Chi Chung Lam; C.-H. Huang; P. Sadayappan πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 254 KB

All-to-all personalized communication is a basic communication operation in a parallel computing environment. In this operation, each processor sends a distinct message to every other processor. It is used in several parallel algorithms, such as for the fast Fourier transform. This paper presents ne