17. Complexity: Approximation Algorithms

Описание к видео 17. Complexity: Approximation Algorithms

MIT 6.046J Design and Analysis of Algorithms, Spring 2015
View the complete course: http://ocw.mit.edu/6-046JS15
Instructor: Srinivas Devadas

In this lecture, Professor Devadas introduces approximation algorithms in the context of NP-hard problems.

License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu

Комментарии

Информация по комментариям в разработке