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 focuses on a collection of open problems related to graph theory and computational complexity, presented by the instructor. The problems range from vertex cover and distance vertex cover to sparse linear regression and satisfiability models. The instructor discusses the challenges and potential solutions for each problem, highlighting the importance of understanding the underlying concepts and applying appropriate methods to tackle these unsolved issues.