✦ LIBER ✦

A Randomized Algorithm for Multipacket Routing on the Mesh

✍ Scribed by S. Rajasekaran; M. Raghavachari

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 365 KB
Volume: 26
Category: Article
ISSN: 0743-7315
DOI: 10.1006/jpdc.1995.1064

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Oblivious Routing Algorithms on the Mesh

Oblivious Routing Algorithms on the Mesh of Buses

✍ Kazuo Iwama; Eiji Miyano 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 226 KB

An optimal W1.5N 1Â2 X lower bound is shown for oblivious routing on the mesh of buses: a two-dimensional parallel model consisting of N 1Â2 \_N 1Â2 processors and N 1Â2 row and N 1Â2 column buses but no local connections between neighboring processors. Many lower bound proofs for routing on mesh-st

Constant-Time Algorithm for the Euclidea

Constant-Time Algorithm for the Euclidean Distance Transform on Reconfigurable Meshes

✍ Amitava Datta; Subbiah Soundaralakshmi 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 288 KB

The Euclidean distance transform (EDT) is an operation to convert a binary image consisting of black and white pixels to a representation where each pixel has the Euclidean distance of the nearest black pixel. The EDT has many applications in computer vision and image processing. In this paper, we p

A Lower Bound for Elementary Oblivious R

A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes

✍ Kazuo Iwama; Eiji Miyano 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 434 KB

This paper shows an important exception to the common perception that three-dimensional meshes are more powerful than two-dimensional ones. Let N be the total number of processors. Then permutation routing over three-dimensional mesh computers needs N 2/3 steps while it takes N 1/2 steps over twodim

A Reliable Randomized Algorithm for the

A Reliable Randomized Algorithm for the Closest-Pair Problem

✍ Martin Dietzfelbinger; Torben Hagerup; Jyrki Katajainen; Martti Penttonen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 361 KB

The following two computational problems are studied: Duplicate grouping: Assume that n items are given, each of which is labeled by an Ä 4 integer key from the set 0, . . . , U y 1 . Store the items in an array of size n such that items with the same key occupy a contiguous segment of the array. C

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

A branch & cut algorithm for the windy g

A branch & cut algorithm for the windy general routing problem and special cases

✍ Angel Corberán; Isaac Plana; José M. Sanchis 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB 👁 1 views

## Abstract In this paper, we present an exact algorithm for the Windy General Routing Problem. This problem generalizes many important Arc Routing Problems and also has some interesting real‐life applications. The Branch & Cut method presented here is based on a cutting‐plane algorithm that identi