𝔖 Bobbio Scriptorium

✦ LIBER ✦

[IEEE 2009 IEEE 50th Annual Symposium on Foundations of Computer Science (FOCS) - Atlanta, GA, USA (2009.10.25-2009.10.27)] 2009 50th Annual IEEE Symposium on Foundations of Computer Science - Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size

✍ Scribed by Moitra, Ankur

Book ID: 126758134
Publisher: IEEE
Year: 2009
Weight: 269 KB
Category: Article
ISBN: 1424451167
DOI: 10.1109/FOCS.2009.28

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[IEEE 2009 IEEE 50th Annual Symposium on

[IEEE 2009 IEEE 50th Annual Symposium on Foundations of Computer Science (FOCS) - Atlanta, GA, USA (2009.10.25-2009.10.27)] 2009 50th Annual IEEE Symposium on Foundations of Computer Science - (Meta) Kernelization

✍ Bodlaender, Hans L.; Fomin, Fedor V.; Lokshtanov, Daniel; Penninkx, Eelko; Saura 📂 Article 📅 2009 🏛 IEEE ⚖ 247 KB

[IEEE 2009 IEEE 50th Annual Symposium on

[IEEE 2009 IEEE 50th Annual Symposium on Foundations of Computer Science (FOCS) - Atlanta, GA, USA (2009.10.25-2009.10.27)] 2009 50th Annual IEEE Symposium on Foundations of Computer Science - Reducibility among Fractional Stability Problems

✍ Kintali, Shiva; Poplawski, Laura J.; Rajaraman, Rajmohan; Sundaram, Ravi; Teng, 📂 Article 📅 2009 🏛 IEEE ⚖ 378 KB

[IEEE 2009 IEEE 50th Annual Symposium on

[IEEE 2009 IEEE 50th Annual Symposium on Foundations of Computer Science (FOCS) - Atlanta, GA, USA (2009.10.25-2009.10.27)] 2009 50th Annual IEEE Symposium on Foundations of Computer Science - Submodular Function Minimization under Covering Constraints

✍ Iwata, Satoru; Nagano, Kiyohito 📂 Article 📅 2009 🏛 IEEE ⚖ 339 KB

[IEEE 2009 IEEE 50th Annual Symposium on

[IEEE 2009 IEEE 50th Annual Symposium on Foundations of Computer Science (FOCS) - Atlanta, GA, USA (2009.10.25-2009.10.27)] 2009 50th Annual IEEE Symposium on Foundations of Computer Science - Constructing Small-Bias Sets from Algebraic-Geometric Codes

✍ Ben-Aroya, Avraham; Ta-Shma, Amnon 📂 Article 📅 2009 🏛 IEEE ⚖ 231 KB

[IEEE 2013 IEEE 54th Annual Symposium on

[IEEE 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS) - Berkeley, CA, USA (2013.10.26-2013.10.29)] 2013 IEEE 54th Annual Symposium on Foundations of Computer Science - Approximation Algorithms for Euler Genus and Related Problems

✍ Chekuri, Chandra; Sidiropoulos, Anastasios 📂 Article 📅 2013 🏛 IEEE ⚖ 322 KB

[IEEE 2006 47th Annual IEEE Symposium on

[IEEE 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) - Berkeley, CA, USA (2006.10.21-2006.10.24)] 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) - Improved Approximation Algorithms for Large Matrices via Random Projections

✍ Sarlos, Tamas 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 222 KB