✦ LIBER ✦

Shortest Paths in Time-Dependent FIFO Networks

✍ Scribed by Frank Dehne; Masoud T. Omran; Jörg-Rüdiger Sack

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shortest paths in piecewise continuous t

✍ M. Dell’Amico; M. Iori; D. Pretolani 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 894 KB

Distributed shortest-path protocols for

✍ Ariel Orda; Raphael Rom 📂 Article 📅 1996 🏛 Springer-Verlag 🌐 English ⚖ 435 KB

Shortest paths in a network with time-de

✍ Kiseok Sung; Michael G.H Bell; Myeongki Seong; Soondal Park 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 171 KB

Point-to-point shortest paths on dynamic

✍ Giacomo Nannicini 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 93 KB

Time depending shortest-path problems wi

✍ K. Nachtigall 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 761 KB

Shortest paths in traffic-light networks

✍ Yen-Liang Chen; Hsu-Hao Yang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 179 KB