TITLE: Fast and Simple Algorithms for Submodular Maximization
ABSTRACT: Submodular maximization captures both classical problems in combinatorial optimization and practical applications that arise in other disciplines, e.g., machine learning and data mining. The size of the inputs in these applications is usually very large. Hence, it is interesting to devise approximation algorithms that in addition to providing a provable guarantee are also very fast and simple to use. In this talk, I will present several such examples from recent years.
Roy Schwartz is an assistant professor at the Computer Science Department at the Technion. His research focuses on the design and analysis of algorithms, approximation algorithms, combinatorial optimization, the geometry of metric spaces and its applications, submodular optimization, and randomized algorithms.