# R9. Approximation Algorithms: Traveling Salesman Problem

## 44 thoughts to “R9. Approximation Algorithms: Traveling Salesman Problem”

1. Jai PM says:

Amartya: you are a Star

2. Michał Robaszyński says:

4:24 INAUDIBLE = https://en.wikipedia.org/wiki/Kruskal%27s_algorithm – he says Kruskal

3. D.R. Page says:

He should slow down or emphasize his syllables. He's difficult to understand sometimes here. Aside from this, it is pretty good.

4. ItsGin says:

for someone who is not a native english speaker, this was way too fast, but nevertheless still more helpful than the lessons at my university

5. Eralp Bayraktar says:

I found it really cool that he juggles the chalk.

6. ritu roy says:

great explanation….

7. Kaan Tas says:

In INAUDIBLE part at 3:56 he says "given by C"

8. Kaan Tas says:

8:41 INAUDABLE: … doing a DFS traversal

9. Kaan Tas says:

9:34 INAUDABLE: we already resolved this..

10. Ray Zhang says:

speed is too fast.

11. Vatsal Mahajan says:

correct : c(C) <= c(T) + c(M)
wrong : c(C) = c(T) + c(M)

12. Whale 小鲸 says:

I love the explanation and teaching style of this young teacher !!!

13. Dixit Patel says:

can't resist looking at his hairs now and then..

14. 胡安啦 says:

his hair is quite cool.

15. staxstix says:

haha, what a cool cat

16. LR says:

If you could talk just a little bit slower it would be great. I had to go back a couple of times to understand what you said. But besides that your explanation is great! Thanks

17. tabaTV says:

settings -> speed -> 0.75 you're welcome

18. james s says:

Some of the things this guy is saying are imprecise/clumsy.

19. florianreichelt says:

21. Thomas Peterson says:

I love how happy he is at the end X)

22. Anastasiia Havriushenko says:

best guy ever, explanation is great, short and clear. thank you!

23. SaintHubbins2 says:

Yo this dude is p. dope

24. Boya Deng says:

Really characteristic lectuer, nice

25. VITA kyo says:

Shwevlebezigleshnow moshlidigerendubulgud tristwenshlemelegendow ….. Got it ?

26. Julien Belanger says:

Nice lecture!

27. Parth Chib says:

Is he is Indian?

28. Alex Tz says:

Perfect lecture, quite amusing too. With subtitles you can follow him easily.

29. Anandakrishnan V says:

10/10.

30. Retro Gaming - Clash Of Clans says:

why r u like 10 and giving a lecture at mit? jeez…Asians are smart

31. LiZzbeth QC says:

spatial approximation tree

32. WahranRai says:

his brain is hyper active : the result is burned hair !!!

33. Eva Ying says:

Anyone knows how to implement this on Matlab?

34. Mihael Bogdanovic says:

this guy explains this way better than the indian prof.. i truely dislike him

35. Odilbek Urmonov says:

just one comment, try to sound each word while your're speaking and don't rash

36. jannatul shaila says:

At first you will be in trouble to understand his word but don't lose your patience believe me this one is the best Explanation for Approximation Algorithms: Traveling Salesman Problem. Just love it

Super great Video! Thanks Amartya Shankha Biswas! Btw, in around 11:40 when he derives the 2-approximation it should be C' and not C. C' is the solution derived by the approximation algorithm.

38. Pavithra raja says:

Reduce speed to .75 my fellow dimwits😂

39. rajupowers says:

What an incredibly delightful teacher!

40. LAKSHAY GARG says:

He is Bengali Indian

41. Eliot McLellan says:

WILLIES

42. Arjun singh Rathore says:

Genius. 🙌