𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Comments on two parallel algorithms for the planar convex hull problem

✍ Scribed by Ivan Stojmenović; David J Evans

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
249 KB
Volume
5
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Distributed algorithm for the planar con
Distributed algorithm for the planar convex hull problem
✍ H.E. Bez; J. Edwards 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 475 KB

The problem of computing the convex hull of a set of vectors in the two-dimensional plane is considered from the point of view ot parallel implementation on transputer networks. A parallel algorithm is described, timed and evaluated against tunctionally equivalent single processor code. The results

A Simple Parallel Algorithm for the Sing
A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
✍ Jesper L. Träff; Christos D. Zaroliagis 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 216 KB

We present a simple parallel algorithm for the single-source shortest path problem in planar digraphs with nonnegative real edge weights. The algorithm runs on the EREW PRAM model of parallel computation in O((n 2= +n 1&= ) log n) time, performing O(n 1+= log n) work for any 0<=<1Â2. The strength of

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