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
Notes for Lecture 12 (PDF) are available.
Course Info
Instructors
As Taught In
Spring
2015
Level
Topics
Learning Resource Types
grading
Exam Solutions
grading
Exams
Instructor Insights
notes
Lecture Notes
theaters
Lecture Videos
assignment_turned_in
Problem Set Solutions
assignment
Problem Sets
theaters
Problem-solving Videos
