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
Approximation Algorithms
Description
This lecture, taught by the instructor, covers approximation algorithms for optimization problems, focusing on vertex cover. The content includes definitions, algorithm design, complexity analysis, and LP relaxation. The lecture explores the concept of integrality gap and provides insights into the process of solving optimization problems using randomized rounding techniques.
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.