MIT
Recitation 9: Complexity: Approximations
Data Science, Analytics & Computer TechnologyAlgorithms and Data StructuresNetworks and SecurityComputer ScienceScience & MathMathematics
Om kurset
Description: In this recitation, problems related to approximation algorithms are discussed, namely the traveling salesman problem. Instructors: Amartya Shankha Biswas