Problem Definition

Loading...
From the course by Stanford University
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
291 ratings
Stanford University

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

291 ratings
Course 3 of 4 in the Specialization Algorithms
From the lesson
Week 1
Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.

Meet the Instructors

  • Tim Roughgarden
    Tim Roughgarden
    Professor
    Computer Science