返回到 Approximation Algorithms Part I

4.7

129 個評分

•

35 個審閱

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....

Jan 27, 2016

The course provides a high-level introduction to approximation algorithm. There is no programming assignments but it provides nice introduction to approximation algorithm.

Sep 17, 2017

This course is awesome. Prof. managed to elaborate the problem and analysis clearly and homework is properly assigned.

篩選依據：

創建者 Zitong W

•Sep 17, 2017

This course is awesome. Prof. managed to elaborate the problem and analysis clearly and homework is properly assigned.

創建者 Pasquale D M

•May 30, 2017

super cool!

創建者 Zhouningnan

•Jan 11, 2017

This class is very clear and easy to understand! Thank you for providing such feast for students!

創建者 Roberto P G J

•Sep 21, 2017

Very good !

創建者 Nihal B

•Feb 05, 2016

A useful course which introduces key ideas in Approximation Algorithms. Looking forward to part II.

創建者 Obinna O

•Jan 16, 2016

awesome course!

I'd like to see part 2 and other graduate-level algorithms courses on coursera.

創建者 Joel K

•May 22, 2016

Great class, and Professor Claire Mathieu is doing an excellent job!

創建者 Do H L

•Jan 21, 2016

Very high-level course. After week1 and I'm already excited to start it

創建者 Mika M

•Jan 23, 2016

The course deals not with programming, but rather with designing and analyzing approximation algorithms. The course is on a high level and focuses on the subject without too much side remarks on applications, connections to other subjects or motivational introductions. If you are a theory person, however, you will probably enjoyed it.

創建者 Christophe C

•Jun 12, 2016

Excellent advanced course! Not for beginner in computer science, nor for people more interested in applying computer science than in theoretical foundations.

創建者 Aliaksei K

•Apr 17, 2016

A really good course for programmers who want to take a bit deeper into CS.

創建者 Deleted A

•Dec 27, 2015

very nice course. i look forward to the second part!

創建者 Pierre-Cyrille H

•Jun 23, 2016

Excellent!

創建者 Karthick S

•May 26, 2016

Excellent Course! I have learnt a lot about Approximation Algorithms in a short span of time.

創建者 Swaprava N

•Jun 27, 2016

This was a relatively easy but well paced introduction to approximation algorithms. I totally enjoyed it.

創建者 Anupam G

•Oct 19, 2017

I am a researcher and (in past) an instructor in SDP, Randomized and Approximation Algorithms.

There are a few instances, where things are not explained as well as an advanced UG or a starting Grad student would like, e.g., Knapsack got a bit delirious somewhere in between (the "special special" case, which IMHO was not needed.)

Otherwise, I love Claire's enthusiasm, and the joy she finds in delivering the ideas. She is succinct everywhere (to me).

創建者 Zhenwei L

•Aug 16, 2019

I love this course!

創建者 Mustafa Q

•Jan 03, 2017

I love how this course delves into a very promising advanced research topic in Computational Complexity. It helps me a lot to understand trending publications in the area. Specially that the material is presented in an incremental approach. This way a researcher can live through the evolution of ideas. It is inspiring also in the way one comes up with a partial solution for the special case, and then generalizes with approximation factor that is satisfyingly good. I'm looking forward to more advanced courses in parameterized, streaming or quantum algorithms.

創建者 Emanuel M

•Nov 06, 2016

good course, with many examples and explanations

創建者 Paulo E d V

•Feb 13, 2017

Great course!

創建者 D. a

•Jan 27, 2016

The course provides a high-level introduction to approximation algorithm. There is no programming assignments but it provides nice introduction to approximation algorithm.

創建者 Pavel V

•Feb 08, 2016

Really good course, the material is quite advanced but very well structured and introduced in a very simple way. The assignments were a lot of fun: really enjoyed the peer-graded assignments where I needed to write short proofs, much more useful than regular multiple-choice answers. Looking forward to the next course!

創建者 Antonio C

•Jul 27, 2017

Really good course and Professor.

創建者 Jun Q

•Dec 05, 2015

This class is the one I am seeking for a long time. Theories of Combinatorial optimization and associated approximation algorithms involve lots of hot research topics in machine learning, image processing, and Bioinformatics. The faculty for this course is a leading expert in the related fields.

創建者 Ilya T

•Aug 27, 2016

The assignments could be a bit improved (some are less good, I would personally complain about knapsack), but in general it is a great course, as it gives an accessible introduction to approximation algorithms (for NP-hard problems), which is a very relevant topic, as NP-hard problems are everywhere.

At the time of writing (end summer 2016), it is also a unique course for this very relevant topic.