Series
Modern Aspects of Submodularity
Modern Aspects of Submodularity
Permanent Link
Series Type
Event Series
Description
Associated Organization(s)
Associated Organization(s)
Publication Search Results
Now showing
1 - 3 of 3
-
ItemOptimization of Submodular Functions: Tutorial - Lecture I( 2012-04-23) Vondrak, Jan
-
ItemOptimization of Submodular Functions: Tutorial - lecture II( 2012-04-23) Vondrak, Jan
-
ItemOptimization of Submodular Functions: Relaxations and Algorithms(Georgia Institute of Technology, 2012-03-19) Vondrak, JanIn this lecture, we cover the basic variants of optimization problems involving submodular functions, and known algorithms for solving them. Some particular problems that will be mentioned: the unconstrained minimization/ maximization of a submodular function, submodular optimization subject to packing/covering constraints, and welfare maximization in combinatorial auctions. Starting from greedy and local search algorithms, we will move on to continuous relaxations of these problems and their role in deriving efficient algorithms. Two important concepts that we will cover here are the Lovasz extension (for minimization), and the multilinear extension (for maximization) of submodular functions.