Sparsest cut
Assaf Naor (Prof.)
| Wed Mar 4, 16:00-17:00 (2 weeks from now) | |
| Lecture held in Online only. |
Abstract: Prof. Assaf Naor is a world-leading mathematician known for his groundbreaking contributions at the interface of metric geometry, analysis, and approximation algorithms. His work has earned numerous major distinctions, including the Nemmers Prize in Mathematics, the Ostrowski Prize, and the Bôcher Memorial Prize. In this talk, he will discuss the Sparsest Cut problem, explain its significance in algorithm design, and present recent algorithm for its efficient approximation, which is a culmination of decades of work.
Mathematics
Audience: researchers in the discipline
( paper )
Theorems of the 21st Century Seminar
Series comments: Theorems of the 21st century series of online seminars aimed at an accessible presentation of some of the most significant mathematical theorems of the 21st century. We are proud to host an impressive list of speakers featuring world-renowned mathematicians.
See blog functor.network/user/3333/entries for detailed announcements of all talks in this seminar series, and more.
| Organizer: | Bogdan Grechuk* |
| *contact for this listing |