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

Instructors:	Prof. Srini Devadas Prof. Erik Demaine Prof. Nancy Lynch
Course Number:	6.046J 18.410J
Departments:	Electrical Engineering and Computer Science Mathematics
Topics:	Engineering > Computer Science > Algorithms and Data Structures Engineering > Computer Science > Computer Networks Engineering > Computer Science > Cryptography Mathematics > Applied Mathematics
As Taught In:	Spring 2015
Level:	Undergraduate

AV lectures - Video

AV recitations

Assignments - problem sets with solutions

Exams - Solutions

Lecture notes - Complete

Instructor Insights