I found it hard to understand this guy at first, but noticed that around 5 minutes in it becomes much easier to understand. He started speaking a lot slower and that seemed to help. perhaps he was just nervous? Either way this lecture was great and I'd recommend turning on CC for the first 5 min or so.
He makes 3 mistakes, just one is a major mistake and the mistake is in 19:17, if understood properly he said that euler circuit only has solution if and only if every vertex has even degree which is false. e.g: A house with an X in the middle [X]> the bottom vertex has 3 edges and the other two has 4 edges and the last one has 2 edges. And there is an euler circuit. Please check the theoream on wiki to verify.
There is definitely no Euler circuit for your example. Wikipedia confirms the theorem he stated. Make sure you have your definitions correct. Remember and Euler circuit has to use every *edge*, not visit every vertex. en.wikipedia.org/wiki/Eulerian_path
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
This definitely will take a few re-watches to (hopefully) understand, but i've already gotten more out of watching this once than I have with any of my class' content lol
I love the way this guy smiles and flips his chalk while preparing for the next equation. His enthusiasm for algorithms is infectious. "That definitely shouldn't be 3/3. That would be P = NP." :D
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.
Great video. The only issue I had was you confusing between matchings, perfect matchings and minimum cost matchings towards the end when you were trying to explain M, M1 and M2.
There is no point for the students attending the lecture and paying thousands of dollars unless the professor is going to interact with the students. Might as well watch a prerecorded video on UA-cam.
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
if you cant be sure about the actual best round-trip, you are finished visiting all places before you could calculate to get 1.5 advantage compared to the best
When he'll be an old and grumpy professor, one of his students will find this video in youtube and be like mind = blown.
his brain is hyper active : the result is burned hair !!!
Laf
colored maybe !
Cycle from MST + skip visiting duplicate vertices: 2-approximation 11:31
Cycle from MST + minimum perfect matching + skip visiting duplicate vertices (Christofides' algorithm): 1.5-approximation 31:36
INAUDIBLE:
3:56 "given by C"
4:24 "Kruskal" (en.wikipedia.org/wiki/Kruskal%27s_algorithm)
8:41 "doing a DFS traversal"
9:34 "we already resolved this"
I love the explanation and teaching style of this young teacher !!!
He is an indian
学习算法的路过
He himself was an undergrad student when he was teaching this.
I found it really cool that he juggles the chalk.
said nobody ever
but he explained it very good, so like :)
Its distracting, not cool, but explanation is good.
sus lan düdük
It'd be cooler if he didn't then find himself trying to write with the wrong end.
I found it hard to understand this guy at first, but noticed that around 5 minutes in it becomes much easier to understand. He started speaking a lot slower and that seemed to help. perhaps he was just nervous? Either way this lecture was great and I'd recommend turning on CC for the first 5 min or so.
Perfect lecture, quite amusing too. With subtitles you can follow him easily.
I love how happy he is at the end X)
I'm always confused why there's so many dislikes on these ocw videos
4:24 INAUDIBLE = en.wikipedia.org/wiki/Kruskal%27s_algorithm - he says Kruskal
He´s a legend.
I was staring at his hair the entire lecture.
He makes 3 mistakes, just one is a major mistake and the mistake is in 19:17, if understood properly he said that euler circuit only has solution if and only if every vertex has even degree which is false. e.g: A house with an X in the middle [X]> the bottom vertex has 3 edges and the other two has 4 edges and the last one has 2 edges. And there is an euler circuit. Please check the theoream on wiki to verify.
There is definitely no Euler circuit for your example. Wikipedia confirms the theorem he stated. Make sure you have your definitions correct. Remember and Euler circuit has to use every *edge*, not visit every vertex. en.wikipedia.org/wiki/Eulerian_path
What an incredibly delightful teacher!
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
you can always use captions!
They only briefly explained the triangle inequality and managed to explain it better than my professor who spent half a lecture on it.
Its because you already know the triangle inequality.
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
You can slow down the speed of the video :)
This definitely will take a few re-watches to (hopefully) understand, but i've already gotten more out of watching this once than I have with any of my class' content lol
settings -> speed -> 0.75 you're welcome
thanks!
I played at 1.75X
I love the way this guy smiles and flips his chalk while preparing for the next equation. His enthusiasm for algorithms is infectious.
"That definitely shouldn't be 3/3. That would be P = NP." :D
best guy ever, explanation is great, short and clear. thank you!
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.
He should slow down or emphasize his syllables. He's difficult to understand sometimes here. Aside from this, it is pretty good.
this guy explained it better than my professor.
Alternative solution: stop traveling and find a new job salesman
Genius. 🙌
Great video. The only issue I had was you confusing between matchings, perfect matchings and minimum cost matchings towards the end when you were trying to explain M, M1 and M2.
Is he is Indian?
YES
Yes,and also a bengali
teacher I developed a heuristic and would like to share it. My heuristic uses topology and concentric circles. What do you think?.
He is Bengali Indian
There is no point for the students attending the lecture and paying thousands of dollars unless the professor is going to interact with the students. Might as well watch a prerecorded video on UA-cam.
I am another Biswas at MIT and this guy is way more hip and cool than me.
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
why r u like 10 and giving a lecture at mit? jeez...Asians are smart
great explanation....
can't resist looking at his hairs now and then..
correct : c(C)
What is five approximation algorithm ?
Get this man some better chalk
Amazing lecture! Thank you!
Great work, thank you
15:08 time stamp for person use
Great Lecture
Nice lecture!
what choice of path will guarantee you the shortest path always
you are missing the connecting edges from the perfect match
the perfect connections, should be easy to generate
if you cant be sure about the actual best round-trip, you are finished visiting all places before you could calculate to get 1.5 advantage compared to the best
Great lecture 👌very well done
Young talent!
Thankyou.
IITian
spatial approximation tree
i like your video!:)
cool
Awesome explanation
his hair is quite cool.
Would expect this from your username lol
Yo this dude is p. dope
Anyone knows how to implement this on Matlab?
haha, what a cool cat
9:34 INAUDABLE: we already resolved this..
8:41 INAUDABLE: ... doing a DFS traversal
In INAUDIBLE part at 3:56 he says "given by C"
10/10.
speed is too fast.
But he teaches very well. It's clear to understand.
Really characteristic lectuer, nice
hello I found the exact solution of this problem . How can I send it to win a prize and get the right of possession?
just one comment, try to sound each word while your're speaking and don't rash
Reduce speed to .75 my fellow dimwits😂
Follow your heart
WILLIES
Some of the things this guy is saying are imprecise/clumsy.
what a freak show... wtf...