Top 50 MOOCs

Get started with custom lists to organize and share courses.

Sign up

Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Approximation Algorithms Part I

2 Reviews 2204 students interested
• Provider Coursera
• Subject Algorithms and Data Structures
• Cost Free Online Course (Audit)
• Session Upcoming
• Language English
• Start Date
• Duration 5 weeks long
• Learn more about MOOCs

Taken this course? Share your experience with other students. Write review

Overview

Sign up to Coursera courses for free Learn how

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.

Syllabus

Vertex cover and Linear Programming
We introduce the course topic by a typical example of a basic problem, called Vertex Cover, for which we will design and analyze a state-of-the-art approximation algorithm using two basic techniques, called Linear Programming Relaxation and Rounding. It is a simple, elementary application of powerful techniques.

Knapsack and Rounding
This module shows the power of rounding by using it to design a near-optimal solution to another basic problem: the Knapsack problem.

Bin Packing, Linear Programming and Rounding
This module shows the sophistication of rounding by using a clever variant for another basic problem: bin packing. (This is a more advanced module.)

Set Cover and Randomized Rounding
This module introduces a simple and powerful variant of rounding, based on probability: randomized rounding. Its power is applied to another basic problem, the Set Cover problem.

Multiway Cut and Randomized Rounding
This module deepens the understanding of randomized rounding by developing a sophisticated variant and applying it to another basic problem, the Multiway Cut problem. (This is a more advanced module.)

Claire Mathieu

Help Center

Most commonly asked questions about Coursera Coursera

Reviews for Coursera's Approximation Algorithms Part I 5.0 Based on 2 reviews

• 5 stars 100%
• 4 star 0%
• 3 star 0%
• 2 star 0%
• 1 star 0%

Did you take this course? Share your experience with other students.

• 1
Anonymous
5.0 3 years ago
completed this course.
I thought this to be an excellent course on some tricky topics. Expect to be both entertained and challenged at the same time. After competing the course there is a complete buzz. Don't forget about part 2.. totally awesome too
1 person found
this review helpful
Was this review helpful to you?
Ali S
5.0 3 years ago
by completed this course.
Was this review helpful to you?
• 1

Class Central

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free

Never Stop Learning!

Get personalized course recommendations, track subjects and courses with reminders, and more.