Anonymous

Changes

From Theory
1 byte added ,  14:13, 3 April 2014
Line 29: Line 29:  
| Apr 4|| 1:00-2:00 PM|| CSIC3120|| [http://terpconnect.umd.edu/~raghavan/ S. Raghu Raghavan] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-4-2014 Weighted and Fractional Versions of the Target Set Selection Problem on Trees]  
 
| Apr 4|| 1:00-2:00 PM|| CSIC3120|| [http://terpconnect.umd.edu/~raghavan/ S. Raghu Raghavan] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-4-2014 Weighted and Fractional Versions of the Target Set Selection Problem on Trees]  
 
|-
 
|-
| 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
+
| 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]  
 
maximization problem]  
 
|-
 
|-