Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Submodular Maximization
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.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.