Add Jean's presentation on hardness of set cover

1 files changed, 22 insertions, 0 deletions

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}
+}