CS Events Monthly View
SeminarSet Cover in Sub-linear Time |
|
||
Wednesday, May 02, 2018, 11:00am |
|||
Given access to a collection of $m$ sets over a ground set of $n$ elements, the classic set cover problem asks for the minimum number of sets in the collection that cover all the elements. We study this problem from the perspective of sub-linear algorithm
Speaker: Sepideh Mahabadi
Bio
I am a Postdoctoral Research Scientist at Simons Collaboration on Algorithms and Geometry based at Data Science Institute of Columbia University , working with Prof. Alexander Andoni. Next year, I will join TTIC as a Research Assistant Professor. My resea
Location : CoRE 301
Committee:
Pranjal Awasthi and Shubhangi Saraf
Event Type: Seminar
Abstract:
Organization:
Columbia University