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
Видео 17. Complexity: Approximation Algorithms канала MIT OpenCourseWare
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
Видео 17. Complexity: Approximation Algorithms канала MIT OpenCourseWare
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
18. Complexity: Fixed-Parameter Algorithms
R8. NP-Complete Problems
R9. Approximation Algorithms: Traveling Salesman Problem
Why is the knapsack problem pseudo-polynomial?
19. Dynamic Programming I: Fibonacci, Shortest Paths
8. NP-Hard and NP-Complete Problems
P vs. NP and the Computational Complexity Zoo
Introduction to Approximation Algorithms - K Center Problem
Greedy Heuristic for Solving the Set Covering Problem
TSP Approximation Algorithms | Solving the Traveling Salesman Problem
1. Algorithmic Thinking, Peak Finding
Topic 25 A Approximation Algorithms
13. Incremental Improvement: Max Flow, Min Cut
15. Linear Programming: LP, reductions, Simplex
P vs. NP - The Biggest Unsolved Problem in Computer Science
R1. Asymptotic Complexity, Peak Finding
16. Complexity: P, NP, NP-completeness, Reductions
21. DP III: Parenthesization, Edit Distance, Knapsack
Design and Analysis of Algorithm -Vertex Cover Approximation Algorithm
