✦ LIBER ✦

The Hardness of Approximating Spanner Problems

✍ Scribed by Michael Elkin; David Peleg

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

NP-completeness of minimum spanner probl

✍ Leizhen Cai 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 544 KB

ON THE HARDNESS OF APPROXIMATING MULTICU

✍ Shuchi Chawla; Robert Krauthgamer; Ravi Kumar; Yuval Rabani; D. Sivakumar 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 241 KB

On the hardness of approximating the per

✍ Bruno Codenotti; John D. Shparlinski; Arne Winterhof 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 194 KB

On the hardness of efficiently approxima

✍ Andreas Brieden; Shawn Cokus 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 206 KB