𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient truthful mechanisms for the single-source shortest paths tree problem

✍ Scribed by L. Gualà; G. Proietti

Publisher
John Wiley and Sons
Year
2007
Tongue
English
Weight
207 KB
Volume
19
Category
Article
ISSN
1532-0626

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Time–Work Tradeoffs of the Single-Source
Time–Work Tradeoffs of the Single-Source Shortest Paths Problem
✍ Hanmao Shi; Thomas H Spencer 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 111 KB

We give parallel algorithms that solve the single-source shortest paths problem Ž . on a weighted, undirected graph with n vertices and m edges in O t lg n time and ŽŽ 3 2 . Ž . . Ž . Ž Ž 3 3 O n rt lg n lg nrt q m lg n work, or in O t lg n time and O n rt q . . mnrt lg n work for any t in the range

Dual algorithms for the shortest path tr
Dual algorithms for the shortest path tree problem
✍ Pallottino, Stefano; Scutell�, Maria Grazia 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB 👁 2 views

We consider dual approaches for the Shortest Path Tree problem. After a brief introduction to the problem, we review the most important dual algorithms which have been described in the literature for its solution and propose a new family of dual ascent algorithms. In these algorithms, ''local'' and

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