𝔖 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 - Submodular Function Minimization under Covering Constraints

✍ Scribed by Iwata, Satoru; Nagano, Kiyohito

Book ID: 125432347
Publisher: IEEE
Year: 2009
Weight: 339 KB
Category: Article
ISBN: 1424451167
DOI: 10.1109/focs.2009.31

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 - Constructing Small-Bias Sets from Algebraic-Geometric Codes

✍ Ben-Aroya, Avraham; Ta-Shma, Amnon 📂 Article 📅 2009 🏛 IEEE ⚖ 231 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 - Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size

✍ Moitra, Ankur 📂 Article 📅 2009 🏛 IEEE ⚖ 269 KB

[IEEE 48th Annual IEEE Symposium on Foun

[IEEE 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) - Providence, RI, USA (2007.10.21-2007.10.23)] 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) - Parameterized Proof Complexity

✍ Dantchev, Stefan; Martin, Barnaby; Szeider, Stefan 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 246 KB

[IEEE 46th Annual IEEE Symposium on Foun

[IEEE 46th Annual IEEE Symposium on Foundations of Computer Science - Pittsburgh, PA (2005.10.25-2005.10.25)] 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05) - Error correction via linear programming

✍ Candes, Emmanuel; Rudelson, Mark; Tao, Terence; Vershynin, Roman 📂 Article 📅 2005 🏛 IEEE ⚖ 430 KB