I Understand
We use cookies.Click here for details.

Approximation Algorithms Part I

Approximation algorithms, Part I How efficiently can you pack objects into a minimum number of boxes? How well can you cluster nodes so as to cheaply separate a network into components around a few centers? These are examples of NP-hard combinatorial optimization problems. It is most likely impossible to solve such problems efficiently, so our aim is to give an approximate solution that can be computed in polynomial time and that at the same time has provable guarantees on its cost relative to the optimum. This course assumes knowledge of a standard undergraduate Algorithms course, and particularly emphasizes algorithms that can be designed using linear programming, a favorite and amazingly successful technique in this area. By taking 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 first of a two-part course on Approximation Algorithms.

Created by École normale supérieure


brand

What you’ll learn


From this educational opportunity you can gain confidence with the compentencies demanded by companies in 2021. The most in demand technique within the learning resource that is frequently requested by employers is Data Analysis. You will also learn about Computer Science, a trait frequently included in job maps.

Who will benefit?


Contrasting material from this learning opportunity with nearly 10,000 data-related job postings, we determine that those interested in Data Scientist roles have the most to gain.