Video details loaded
HomeMIT 6.046J Design and Analysis of Algorithms, Spring 2015Lecture 12: Greedy Algorithms: Minimum Spanning Tree
Lecture 12: Greedy Algorithms: Minimum Spanning Tree
1:22:10
Description: In this lecture, Professor Demaine introduces greedy algorithms, which make locally-best choices without regards to the future.
Instructors: Erik Demaine
