✦ LIBER ✦

Efficient algorithms for the 2-Way Multi Modal Shortest Path Problem

✍ Scribed by Huguet, Marie-José; Kirchler, Dominik; Parent, Pierre; Wolfler Calvo, Roberto

Book ID: 123094520
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 550 KB
Volume: 41
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2013.05.122

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient P-D algorithm for shortest

An efficient P-D algorithm for shortest path problem

✍ Cheng'en Yang; Shuli Liang 📂 Article 📅 1997 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 243 KB

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

Algorithms for the Weight Constrained Sh

Algorithms for the Weight Constrained Shortest Path Problem

✍ Irina Dumitrescu; Natashia Boland 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 241 KB

An efficient VLSI algorithm for the all

An efficient VLSI algorithm for the all pairs shortest path problem

✍ Tadad Takaoka; Kiyomi Umehara 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 587 KB

Parallel algorithms for the single sourc

Parallel algorithms for the single source shortest path problem

✍ P. Mateti; N. Deo 📂 Article 📅 1982 🏛 Springer Vienna 🌐 English ⚖ 880 KB

An efficient fault-containing self-stabi

An efficient fault-containing self-stabilizing algorithm for the shortest path problem

✍ Tetz C. Huang 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 369 KB