From ea13fe190d9c17394e14edd9ed27c9977aebf2cf Mon Sep 17 00:00:00 2001
From: Thibaut Horel <thibaut.horel@gmail.com>
Date: Tue, 28 Apr 2015 15:03:32 -0400
Subject: Add Jean's presentation on hardness of set cover

---
 papers/feige1998.pdf  | Bin 0 -> 280784 bytes
 papers/filmus2011.pdf | Bin 0 -> 115857 bytes
 sessions.csv          |   2 ++
 sub.bib               |  22 ++++++++++++++++++++++
 4 files changed, 24 insertions(+)
 create mode 100644 papers/feige1998.pdf
 create mode 100644 papers/filmus2011.pdf

diff --git a/papers/feige1998.pdf b/papers/feige1998.pdf
new file mode 100644
index 0000000..739a055
Binary files /dev/null and b/papers/feige1998.pdf differ
diff --git a/papers/filmus2011.pdf b/papers/filmus2011.pdf
new file mode 100644
index 0000000..e25b0b1
Binary files /dev/null and b/papers/filmus2011.pdf differ
diff --git a/sessions.csv b/sessions.csv
index 924faa1..ea44a4f 100644
--- a/sessions.csv
+++ b/sessions.csv
@@ -7,3 +7,5 @@ date,speaker,refs,summary
 2015-03-12,Thibaut,"filmus2012,filmus2012tight,filmus2014","combinatorial algorithm for coverage (and submodular) maximization over a matroid"
 2015-03-26,Jean,"feige2011","unconstrainted non-monotone submodular maximization, random set, local search"
 2015-04-02,Eric,"buchbinder2012","randomized, linear-time optimal unconstrained non-monotone submodular maximization"
+2015-04-09,Thibaut,"lee2009","non-monotone submodular maximization under matroid and knapsack constraints"
+2015-04-23,Jean,"feige1998,filmus2011","inapproximablity of set cover"
diff --git a/sub.bib b/sub.bib
index c947a07..417bdb4 100644
--- a/sub.bib
+++ b/sub.bib
@@ -183,3 +183,25 @@
   biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/BuchbinderFNS12},
   bibsource = {dblp computer science bibliography, http://dblp.org}
 }
+
+@inproceedings{lee2009,
+  author    = {Jon Lee and
+               Vahab S. Mirrokni and
+               Viswanath Nagarajan and
+               Maxim Sviridenko},
+  title     = {Non-monotone submodular maximization under matroid and knapsack constraints},
+  booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing,
+               {STOC} 2009},
+  pages     = {323--332},
+  year      = {2009},
+  timestamp = {Fri, 05 Jun 2009 09:34:35 +0200},
+  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/LeeMNS09},
+  bibsource = {dblp computer science bibliography, http://dblp.org}
+}
+
+@unpublished{filmus2011,
+  title={Hardness of Approximating Set Cover},
+  author={Filmus, Yuval},
+  year={2011},
+  month={January}
+}
-- 
cgit v1.2.3-70-g09d2