Difference between revisions of "CATS"

Revision as of 16:46, 20 November 2015

Date	Time	Location	Speaker	Title
Aug 3	11:00 AM-12:00 PM	CSIC 1121	Joel Spencer	Finding Needles in Exponential Haystacks
Sept 11	1:00-2:00 PM	CSIC3118	Manish Purohit	Approximation Algorithms for Connected Maximum Cut and Related Problems
Sept 25	1:00-2:00 PM	CSIC3118	Karthik A Sankararaman	Lassere Hierarchy
Oct 2	1:00-2:00 PM	CSIC3118	Pan Xu	Lassere Hierarchy
Oct 9	1:00-2:00 PM	CSIC3118	Hossein Esfandiari	Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models
Oct 30	1:00-2:00 PM	CSIC3118	Manish Purohit	Two Faces of Algorithm Design: Optimization and Learning
Nov 6	1:00-2:00 PM	CSIC3118	Khoa Trinh	An Improved Approximation Algorithm for Knapsack Median
Nov 13	1:00-2:00 PM	CSIC3118	Soheil Ehsani	Online Degree-Bounded Steiner Network Design
Nov 20	1:00-2:00 PM	AVW 4424	Saeed Seddighin	The power of stochastic modeling, beating theoretically proven lower bounds of optimization problems
Dec 4	1:00-2:00 PM	CSIC3118	Sina Dehghani	TBA
Dec 11	1:00-2:00 PM	CSIC3118	Babis (MIT)	TBA

@@ Line 23: / Line 23: @@
 | Nov 13|| 1:00-2:00 PM|| CSIC3118|| Soheil Ehsani || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Nov-13-2015 Online Degree-Bounded Steiner Network Design]
 |-
-| Nov 20|| 1:00-2:00 PM|| AVW 4424|| Saeed Seddighin ||  [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Nov-20-2015 The power of stochastic modeling, beating theoretically
+| Nov 20|| 1:00-2:00 PM|| AVW 4424|| Saeed Seddighin ||  [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Nov-20-2015 The power of stochastic modeling, beating theoretically proven lower bounds of optimization problems]
-proven lower bounds of optimization problems]
 |-
 | Dec 4 || 1:00-2:00 PM|| CSIC3118|| Sina Dehghani || TBA