Semester.ly

Johns Hopkins University | EN.600.469

Approximation Algorithms

3.0

credits

Average Course Rating

(4.43)

This course provides an introduction to approximation algorithms. Topics include vertex cover, TSP, Steiner trees, cuts, greedy approach, linear and semi-definite programming, primal-dual method, and randomization. Additional topics will be covered as time permits. There will be a final project. Students may receive credit for EN.600.469 or EN.600.669, but not both. [Analysis]

Fall 2013

(4.43)

Spring 2015

(4.43)

Fall 2013

Professor: Vladimir Braverman

(4.43)

Students thought that the good aspects of this course included the hands-on, practical application of the materials. They liked choosing their own projects and liked the breadth of topics covered over the course. They thought that the course was somewhat unorganized and that the course did not always stick to the syl abus. Suggestions for improvement included providing more lectures and additional assignments to support the final project. Prospective students should have an idea for their final project before taking the course and know the basics to researching and sharing academic papers. 88

Spring 2015

Professor: Michael Dinitz

(4.43)

The best aspects of the class included the interesting subject matter, the entertaining and interactive lectures, and the exposure to cutting edge developments in the field. Delayed feedback on assignments prevented students from having opportunities to improve, and the exceptional y fast pace of the class made it difficult to keep up with concepts. As a result, students suggested slowing the pace in class and giving shorter assignments that emphasized understanding rather than task completion. Prospective students will benefit from a background in linear algebra, machine learning, and statistics. This course was based more in programming than theory, and dealt largely with statistical modeling.