✦ LIBER ✦

Algorithm of conditional minimization of the goal function for optimal routing in information networks

✍ Scribed by V. I. Parfenov; S. V. Zolotarev

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal algorithms for dissemination of

✍ Juraj Hromkovič; Claus -Dieter Jeschke; Burkhard Monien 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 809 KB

Simplified Optimality Conditions for Min

✍ F. Flores-BAZÁN; W. Oettli 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 146 KB

Enhanced-robustness Dijkstra algorithm f

✍ N. A. Kuznetsov; V. N. Fetisov 📂 Article 📅 2008 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 285 KB

An efficient algorithm for optimal alloc

✍ Wei Li; Jun He; Yuan Li; Deming Liu; Dexiu Huang 📂 Article 📅 2004 🏛 Optics InfoBase 🌐 English ⚖ 663 KB

Uniqueness of the solution for optimal s

✍ H. Kameda; Y. Zhang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 791 KB

In-Network Distributed Algorithm for Ene

✍ Trdlicka, J.; Hanzalek, Z. 📂 Article 📅 2012 🏛 IEEE 🌐 English ⚖ 537 KB