6.046J | Spring 2015 | Undergraduate
Design and Analysis of Algorithms
Lecture Videos

Lecture 12: Greedy Algorithms: Minimum Spanning Tree

Description: In this lecture, Professor Demaine introduces greedy algorithms, which make locally-best choices without regards to the future.

Instructors: Erik Demaine

Transcript
Lecture Notes
Notes for Lecture 12 (PDF) are available.
Learning Resource Types
theaters Lecture Videos
theaters Recitation Videos
assignment_turned_in Problem Sets with Solutions
grading Exams with Solutions
notes Lecture Notes
co_present Instructor Insights