R9. Approximation Algorithms for the Traveling Salesman Problem
Lecture from MIT 6.046J (Spring 2015) covering approximation algorithms for the Traveling Salesman Problem, taught by Amartya Shankha Biswas.
MIT OpenCourseWare
138.6K views • Mar 4, 2016
About this video
MIT 6.046J Design and Analysis of Algorithms, Spring 2015
View the complete course: http://ocw.mit.edu/6-046JS15
Instructor: Amartya Shankha Biswas
In this recitation, problems related to approximation algorithms are discussed, namely the traveling salesman problem.
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
View the complete course: http://ocw.mit.edu/6-046JS15
Instructor: Amartya Shankha Biswas
In this recitation, problems related to approximation algorithms are discussed, namely the traveling salesman problem.
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
138.6K
Likes
1.8K
Duration
31:59
Published
Mar 4, 2016
User Reviews
4.6
(27) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
No specific trending topics match this video yet.
Explore All Trends