Lecture

Submodular Maximization

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

CS-450: Algorithms II

A first graduate course in algorithms, this course assumes minimal background, but moves rapidly. The objective is to learn the main techniques of algorithm analysis and design, while building a repertory of basic algorithmic solutions to problems in many ...

Description

This lecture covers the topic of submodular functions and their maximization, focusing on the greedy algorithm and its approximation guarantee. The instructor explains the concept of monotonicity and demonstrates the greedy algorithm step by step, emphasizing its approximation ratio and the importance of special elements in the process.

Instructors (3)

Mikhail Kapralov

Teaching & PhD PhD Students Weronika Wrzos-Kaminska, Guy Weissenberg, Davide Mazzali, Ekaterina Kochetkova, Kshiteej Jitesh Sheth Past EPFL PhD Students Amir Zandieh, Aidasadat Mousavifar, Navid Nouri, Jakab Tardos, Grzegorz Adam Gluch, Makarov Mikhail Past EPFL PhD Students as codirector Paritosh Garg Courses Algorithms II CS-450 The students learn the theory and practice of basic concepts and techniques in algorithms. The course covers mathematical induction, techniques for analyzing alg

Ola Nils Anders Svensson

Alessandro Chiesa

Alessandro Chiesa is a faculty member in computer science. He conducts research in complexity theory, cryptography, and security, with a focus on the theoretical foundations and practical implementations of cryptographic proofs that are short and easy to verify. He is a co-author of several zkSNARK libraries, and is a co-inventor of the Zerocash protocol. He has co-founded Zcash and StarkWare Industries. He is a recipient of a Sloan Research Fellowship (2021), an Okawa Foundation Research Grant (2020), and Google Faculty Research Awards (2018 and 2017). He was included in MIT Technology Review's "35 Innovators Under 35" list in 2018.

Official source

Related concepts (31)

Utility functions on indivisible goods

Some branches of economics and game theory deal with indivisible goods, discrete items that can be traded only as a whole. For example, in combinatorial auctions there is a finite set of items, and every agent can buy a subset of the items, but an item cannot be divided among two or more agents. It is usually assumed that every agent assigns subjective utility to every subset of the items. This can be represented in one of two ways: An ordinal utility preference relation, usually marked by .

Diophantine approximation

In number theory, the study of Diophantine approximation deals with the approximation of real numbers by rational numbers. It is named after Diophantus of Alexandria. The first problem was to know how well a real number can be approximated by rational numbers. For this problem, a rational number a/b is a "good" approximation of a real number α if the absolute value of the difference between a/b and α may not decrease if a/b is replaced by another rational number with a smaller denominator.

Kruskal's algorithm

Kruskal's algorithm (also known as Kruskal's method) finds a minimum spanning forest of an undirected edge-weighted graph. If the graph is connected, it finds a minimum spanning tree. (A minimum spanning tree of a connected graph is a subset of the edges that forms a tree that includes every vertex, where the sum of the weights of all the edges in the tree is minimized. For a disconnected graph, a minimum spanning forest is composed of a minimum spanning tree for each connected component.

Sin

In a religious context, 'sin' is a transgression against divine law or a law of God. Each culture has its own interpretation of what it means to commit a sin. While sins are generally considered actions, any thought, word, or act considered immoral, selfish, shameful, harmful, or alienating might be termed "sinful".

Mortal sin

A mortal sin (peccatum mortale), in Catholic theology, is a gravely sinful act which can lead to damnation if a person does not repent of the sin before death. It is alternatively called deadly, grave, and serious. A sin is considered to be "mortal" when its quality is such that it leads to a separation of that person from God's saving grace. Three conditions must together be met for a sin to be mortal: "Mortal sin is sin whose object is grave matter and which is also committed with full knowledge and deliberate consent.

Related lectures (41)

05.10.23 - Gauss and Green theorem in 2D

Introduction to Plasma Physics

Introduces the basics of plasma physics, covering collective behavior, Debye length, and plasma conditions.

Simple Pendulum and Harmonic Oscillator

Explores the dynamics of a simple pendulum and harmonic oscillator, including Hooke's Law and equations of motion.

Approximation Algorithms

Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.

Dynamical Effects: Thickness Fringes MOOC: Transmission Electron Microscopy for Materials Sciences

Delves into the dynamical scattering effect of thickness fringes in TEM images, covering equations, intensity plots, and weak beam imaging.

Related concepts (31)

Utility functions on indivisible goods

Diophantine approximation

Kruskal's algorithm

Sin

Mortal sin