מידע כללי General Information Общая Информация معلومات عامة

Submodular functions, which capture the property of diminishing returns, are ubiquitous in various disciplines, including combinatorics, graph theory, machine learning, economics, algorithmic game theory, and information theory. The family of submodular optimization problems is a prime example of a unified approach that captures well known classic problems, e.g., Max-Cut and Generalized-Assignment, and real world applications in diverse setting, e.g., viral marketing in social networks, recommender systems, and information gathering. This course deals with the algorithmic foundations of submodular optimization, focusing on basic problems and algorithmic techniques.