✦ LIBER ✦

A simple efficient approximation scheme for the restricted shortest path problem

✍ Scribed by Dean H. Lorenz; Danny Raz

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Fully Dynamic Approximation Scheme for

✍ P. N. Klein; S. Subramanian 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 219 KB

Improved algorithms for the k simple sho

✍ Zvi Gotthilf; Moshe Lewenstein 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 172 KB

An efficient VLSI algorithm for the all

✍ Tadad Takaoka; Kiyomi Umehara 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 587 KB

Exact and Approximate Truthful Mechanism

✍ Luciano Gualà; Guido Proietti 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 504 KB

A Lower Bound for the Shortest Path Prob

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

An efficient fault-containing self-stabi

✍ Tetz C. Huang 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 369 KB