R6. Greedy Algorithms
MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: http://ocw.mit.edu/6-046JS15 Instructor: Amartya Shankha Biswas In this recitation, problems related to greedy algorithms are discussed. License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu
▶︎
13. Incremental Improvement: Max Flow, Min Cut
▶︎
12. Greedy Algorithms: Minimum Spanning Tree
▶︎
Greedy Stays Ahead (Algorithms 08)
▶︎
Greedy Algorithms Explained
▶︎
How to Speak
▶︎
Greedy Exchange Arguments (Algorithms 09)
▶︎
10. Dynamic Programming: Advanced DP
▶︎
A visual guide to Bayesian thinking
▶︎
Advanced Algorithms (COMPSCI 224), Lecture 1
▶︎
3. Greedy Method - Introduction
▶︎
The Strange Math That Predicts (Almost) Anything
▶︎
Turing Award Winner: Disagreeing with Google, Postgres, Future Problems | Mike Stonebraker
▶︎
10/4/08 Robert Grober - The Physics of Golf
▶︎
Interval Scheduling Maximization (Proof w/ Exchange Argument)
▶︎
JANITOR vs THE BIGGEST GUYS IN THE GYM. They Didn’t Expect THAT
▶︎
You Know This Song (but the Orchestra Doesn’t) | Jacob Collier & VSO School of Music Orchestra | TED
▶︎
Coding Interview Patterns - Greedy Problems | 7 different problems in a single video
▶︎
R9. Approximation Algorithms: Traveling Salesman Problem
▶︎