✦ LIBER ✦

New Bounds on the Complexity of the Shortest Path Problem

✍ Scribed by Fredman, Michael L.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new upper bound on the complexity of t

✍ Tadao Takaoka 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 262 KB

New models for the robust shortest path

✍ Virginie Gabrel, Cécile Murat, Lei Wu 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 916 KB

A Lower Bound for the Shortest Path Prob

✍ Ketan Mulmuley; Pradyut Shah 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 183 KB

Complexity analysis and optimization of

✍ Paola Festa 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 700 KB

Bounds and Heuristics for the Shortest C

✍ Marie-Christine Costa; Alain Hertz; Michel Mittaz 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 147 KB

The lower bounds on distributed shortest

✍ K.V.S. Ramarao; S. Venkatesan 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 507 KB