Theory

Changes

CATS (view source)

Revision as of 01:23, 20 April 2016

255 bytes added ,  01:23, 20 April 2016
→‎Spring 2016
Line 26: Line 26:  
| April 8|| 1:00-2:00 PM|| CSIC 2107|| [http://www.maa.org/fern-y-hunt Fern Hunt] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-8-2016 An Algorithm for Identifying Optimal Spreaders in a Random Walk Model of Network Communication]
 
| April 8|| 1:00-2:00 PM|| CSIC 2107|| [http://www.maa.org/fern-y-hunt Fern Hunt] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-8-2016 An Algorithm for Identifying Optimal Spreaders in a Random Walk Model of Network Communication]
 
|-
 
|-
−
| April 15|| 1:00-2:00 PM|| CSIC 2107|| Saba Ahmadi || TBA
+
| April 15|| 1:00-2:00 PM|| CSIC 2107|| Saba Ahmadi || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-15-2016 Dynamic (1+\epsilon)-Approximate Matchings: A Density Sensitive Approach]
 
|-
 
|-
−
| April 22|| 1:00-2:00 PM|| CSIC 2107|| Ahmed Abdelkader || TBA
+
| April 22|| 1:00-2:00 PM|| CSIC 2107|| Ahmed Abdelkader || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-22-2016 Approximating the ATSP on topologically restricted graphs]
 
|-
 
|-
 
| April 29|| 1:00-2:00 PM|| CSIC 2107|| Yang Sheng || TBA
 
| April 29|| 1:00-2:00 PM|| CSIC 2107|| Yang Sheng || TBA
Karthikabinav
editor
178

edits

Retrieved from "https://wiki.cs.umd.edu/theory/view/Special:MobileDiff/2060"