Line 31:
Line 31:
| Apr 11|| 1:00-2:00 PM|| CSIC1115|| [http://www.cs.toronto.edu/~bor/ Allan Borodin] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-11-2014 Greedy-like algorithms and a myopic model for the non-monotone submodular maximization problem]
| Apr 11|| 1:00-2:00 PM|| CSIC1115|| [http://www.cs.toronto.edu/~bor/ Allan Borodin] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-11-2014 Greedy-like algorithms and a myopic model for the non-monotone submodular maximization problem]
|-
|-
−
| Apr 18|| 1:00-2:00 PM|| CSIC3120|| [http://www.cs.jhu.edu/~mdinitz/ Michael Dinitz] || TBS
+
| Apr 18|| 1:00-2:00 PM|| CSIC3120|| [http://www.cs.jhu.edu/~mdinitz/ Michael Dinitz] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-18-2014 Label Cover Instances with Large Girth and the Hardness of Approximating Spanners]
|-
|-
| May 2|| 1:00-2:00 PM|| CSIC1115|| [https://sites.google.com/site/quaerereverum9/ Rakesh Vohra] || TBA
| May 2|| 1:00-2:00 PM|| CSIC1115|| [https://sites.google.com/site/quaerereverum9/ Rakesh Vohra] || TBA