✦ LIBER ✦

Distributed shortest-path protocols for time-dependent networks

✍ Scribed by Ariel Orda; Raphael Rom

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shortest Paths in Time-Dependent FIFO Ne

✍ Frank Dehne; Masoud T. Omran; Jörg-Rüdiger Sack 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 776 KB

Shortest paths in piecewise continuous t

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

An efficient distributed protocol for fi

✍ Lakshmanan, K.B.; Thulasiraman, K.; Comeau, M.A. 📂 Article 📅 1989 🏛 IEEE 🌐 English ⚖ 777 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

Time depending shortest-path problems wi

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

Distribution network planning based on s

✍ Zhi-ying Lu 路志英, Shan Gao 高山, Li Yao 姚丽 📂 Article 📅 2012 🏛 Central South University 🌐 English ⚖ 624 KB