✦ LIBER ✦

On the Hardness of Approximating the Network Coding Capacity

✍ Scribed by Langberg, M.; Sprintson, A.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Capacity of Noncoherent Network C

✍ Siavoshani, M.J.; Mohajer, S.; Fragouli, C.; Diggavi, S.N. 📂 Article 📅 2011 🏛 IEEE 🌐 English ⚖ 561 KB

On the capacity of network coding for ra

✍ Ramamoorthy, A.; Shi, J.; Wesel, R.D. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 363 KB

On the Hardness of Approximating the Chr

✍ Khanna, Sanjeev (author);Linial, Nathan (author);Safra, Shmuel (author) 📂 Article 📅 2000 🏛 Janos Bolyai Mathematical Society 🌐 English ⚖ 311 KB

On the Hardness of Approximating the Chr

✍ Khanna, Sanjeev (author);Linial, Nathan (author);Safra, Shmuel (author) 📂 Article 📅 2000 🏛 Janos Bolyai Mathematical Society 🌐 English ⚖ 311 KB

On the Hardness of Approximating the Min

✍ Ramkumar Chinchani; Duc Ha; Anusha Iyer; Hung Q. Ngo; Shambhu Upadhyaya 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 749 KB

The Hardness of Approximating Spanner Pr

✍ Michael Elkin; David Peleg 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 366 KB