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.
This lecture covers the (log n) approximation algorithm for the sparsest cut problem, presenting the mathematical theorems and proofs step by step. It discusses the process of embedding and optimizing the cut metric, emphasizing the efficient randomized algorithm used for computation.