Approximation Algorithms Part II
list 4 sequences
assignment Level : Introductive
chat_bubble_outline Language : English
card_giftcard 1 point
Users' reviews
-
starstarstarstarstar

Key Information

credit_card Free access
verified_user Fee-based Certificate

About the content

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.

more_horiz Read more
more_horiz Read less
dns

Syllabus

  • Week 1 - Linear Programming Duality
    This module does not study any specific combinatorial optimization problem. Instead, it introduces a central feature of linear programming, duality.
  • Week 2 - Steiner Forest and Primal-Dual Approximation Algorithms
    This module uses linear programming duality to design an algorithm for another basic problem, the Steiner forest problem.
  • Week 3 - Facility Location and Primal-Dual Approximation Algorithms
    This module continues teaching algorithmic applications of linear programming duality by applying it to another basic problem, the facility location problem.
  • Week 4 - Maximum Cut and Semi-Definite Programming
    We introduce a generalization of linear programming, semi-definite programming.This module uses semi-definite programming to design an approximation algorithm for another basic problem, the maximum cut problem.
record_voice_over

Instructors

Claire Mathieu

store

Content Designer

École normale supérieure

The École normale supérieure (ENS) is an elite higher education institution (graduate school) for advanced undergraduate and graduate studies, and a prestigious French research center. It encompasses fifteen teaching and research departments, spanning the main humanities, sciences and disciplines. Unique among France’s grandes écoles for its training in the humanities and sciences, the ENS prepares its students for their role as future leaders in every imaginable professional field: in research, media, public service and private industry.

assistant

Platform

Coursera

Coursera is a digital company offering massive open online course founded by computer teachers Andrew Ng and Daphne Koller Stanford University, located in Mountain View, California. 

Coursera works with top universities and organizations to make some of their courses available online, and offers courses in many subjects, including: physics, engineering, humanities, medicine, biology, social sciences, mathematics, business, computer science, digital marketing, data science, and other subjects.

You are the designer of this MOOC?
What is your opinion on this resource ?
Content
0/5
Platform
0/5
Animation
0/5