PhD Student Brian Brubach, who is advised by Professor Aravind Srinivasan, also gave a paper entitled New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching with Karthik A. Sankararaman, Aravind Srinivasan, and Pan Xu.
PhD Candidate Melika Abolhassani, who is advised by Professsor Mohammad Hajiaghayi, presented a paper entitled Beating Ratio 0.5 for Weighted Oblivious Matching Problems with Chan, T.-H. Hubert ; Chen, Fei ; Esfandiari, Hossein ; Hajiaghayi, MohammadTaghi ; Hamid, Mahini ; Wu, Xiaowei
At the same conference, two students from the department’s Research Experience for Undergraduates (REU) program, Riley Murray and Megan Chao presented a paper entitled Scheduling Distributed Clusters of Parallel Machines: Primal-Dual and LP-based Approximation Algorithms with Samir Khuller.
The Department welcomes comments, suggestions and corrections. Send email to editor [at] cs.umd.edu.