Approximation algorithms, Part 2 This is the continuation of Approximation algorithms, Part 1. Here you will learn linear programming duality applied to the design of some approximation algorithms, and semidefinite programming applied to Maxcut. By taking the two parts of this course, you will be exposed to a range of problems at the foundations of theoretical computer science, and to powerful design and analysis techniques. Upon completion, you will be able to recognize, when faced with a new combinatorial optimization problem, whether it is close to one of a few known basic problems, and will be able to design linear programming relaxations and use randomized rounding to attempt to solve your own problem. The course content and in particular the homework is of a theoretical nature without any programming assignments. This is the second of a two-part course on Approximation Algorithms.
At the same time a French grande école and a university, the Ecole normale supérieure provides in Paris, at the heart of the Quartier latin, excellent training through research, leading to various teaching and research professions, and contributes to train through research the senior executives of public administrations as well as of French and European companies. The ENS also defines and applies scientific and technological research policies, from a multidisciplinary and international perspective.
Intellectual freedom, multidisciplinarity in humanities and sciences, individual attention to students, bountiful campus life, gathering students and professors from all disciplines, form the heart of the specificities of the Ecole normale supérieure. Since more than 2 centuries, the ENS prepares its students to the most various openings and the highest responsibilities, while being fully invested in the intellectual, scientific and cultural debates of its time – in particular through the multiplicity of the normaliens’ engagement.