✦ LIBER ✦

Improved algorithms for the k simple shortest paths and the replacement paths problems

✍ Scribed by Zvi Gotthilf; Moshe Lewenstein

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding the k shortest simple paths

✍ Hershberger, John; Maxel, Matthew; Suri, Subhash 📂 Article 📅 2007 🏛 Association for Computing Machinery 🌐 English ⚖ 340 KB

An efficient algorithm for K shortest si

✍ N. Katoh; T. Ibaraki; H. Mine 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 878 KB

Improved algorithms for replacement path

✍ Amit M. Bhosle 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 200 KB

Parallel Asynchronous Algorithms for the

✍ F. Guerriero; R. Musmanno 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 537 KB

An Improved Distribution Algorithm for S

✍ Lakani, G.D. 📂 Article 📅 1984 🏛 IEEE 🌐 English ⚖ 629 KB

An improved solution algorithm for the c

✍ Luis Santos; João Coutinho-Rodrigues; John R. Current 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 213 KB