Certificate Our team is analyzing your review. If everything is ok, it will be posted soon. We also reserve the rights to remove it from our system if we believe the content violates our policies
  • Home
  • Coursera
  • Approximation Algorithms Part I
Coursera

Approximation Algorithms Part I

4.5
Not specified
Free
Go to Course
Free
Go to Course

Pricing

Per Course

Course Details

en
fr, pt, ru, en, es
Self-paced

About this Course

Approximation algorithms, Part IHow 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.