*********************************
There is now a CONTENT FREEZE for Mercury while we switch to a new platform. It began on Friday, March 10 at 6pm and will end on Wednesday, March 15 at noon. No new content can be created during this time, but all material in the system as of the beginning of the freeze will be migrated to the new platform, including users and groups. Functionally the new site is identical to the old one. webteam@gatech.edu
*********************************
TITLE: Continuous Approaches in Submodular Optimization
ABSTRACT:
The study of combinatorial problems with a submodular objective has attracted much attention in recent years, and is partly motivated by the fact that such problems arise in diverse settings such as combinatorial optimization, algorithmic game theory, economics, machine learning and social networks. This talk will survey some of the continuous approaches used in the last decade for constrained submodular maximization. One approach of particular interest that will be discussed is the continuous greedy algorithm and its applications.
BIO: Roy Schwartz in currently an assistant professor in the Department of Computer Science at the Technion.
His research interests include the design and analysis of algorithms, combinatorial optimization, approximation algorithms, the geometry of metric spaces and its applications, submodular optimization, and randomized algorithms
