Unless otherwise noted, all seminars will take place in the 6th floor conference room of Donald Bren Hall (DBH 6011). Refreshments will be served at 10:50am, and the seminar talks will run from 11:00am until noon.
For additional information, please contact CS Seminar Administrative Coordinator, Mare Stasik, at firstname.lastname@example.org or (949) 824-7651.
December 6, 2019
11:00am - 12:00pm
Donald Bren Hall 6011
In this talk, I will provide my perspectives on the design of approximation algorithms for hard optimization problems. What makes them practical or impractical? What is their theoretical value? What are some of the underlying design ideas and techniques? I will try to address these questions, and illustrate related concepts using both classical results in the field and also some of my favorite longstanding open problems.
His research interests are in Algorithms, Combinatorics and Optimization, and has obtained various techniques to design and analyze approximation algorithms, including the use of semidefinite programming.
He has received the Fulkerson Prize, twice the SIAM Optimization Prize, a Guggenheim Fellowship, and the Farkas Prize. He is a fellow of ACM, AMS, and SIAM.