A Second Course in Algorithms (Lecture 6: Generalizations of Maximum Flow and Bipartite Matching)
Finish the Hungarian algorithm. Survey of efficiently solvable generalizations of maximum flow and min-cost bipartite matching (min-cost flow, nonbipartite matching, etc.). Full course playlist: • A Second Course in Algorithms (Stanford CS... Lecture notes: http://timroughgarden.org/w16/l/l6.pdf
▶︎
A Second Course in Algorithms (Lecture 7: Linear Programming: Introduction and Applications)
▶︎
A Second Course in Algorithms (Lecture 3: The Push-Relabel Algorithm for Maximum Flow)
▶︎
A Second Course in Algorithms (Lecture 11: Online Learning and the Multiplicative Weights Algorithm)
▶︎
Trump Gets Booed & Falls Asleep During NBA Finals, Claims War is Almost Over & Goodbye Spencer Pratt
▶︎
The Blossom Algorithm
▶︎
The Insane Genius of a Formula 1 Gearbox
▶︎
I am done with Golang
▶︎
Bipartite Graphs and Maximum Matchings
▶︎
Turing Award Winner: Disagreeing with Google, Postgres, Future Problems | Mike Stonebraker
▶︎
Richard Feynman: Can Machines Think?
▶︎
A Second Course in Algorithms (Lecture 1: Course Goals and Introduction to Maximum Flow)
▶︎
Russell's Paradox - a simple explanation of a profound problem
▶︎
General Relativity Lecture 1
▶︎
Something is jamming GPS over Europe. Here's what we found
▶︎
A Second Course in Algorithms (Lecture 14: Online Bipartite Matching)
▶︎
The Crystal That's So Stable It Could Destroy All Medicine
▶︎
How to Speak
▶︎
Do Google engineers actually vibe code?
▶︎