
CSE202, Spring 2021: Combinatorial Algorithms
Dormant Last read · last published · next check
Read 2 days ago and current, but nothing has been published for 5 years.
Latest videos
Saves to your Watch queue, to pick up on another day or another device.


CSE202, Lec 14: Introduction to multiway cut and 2-approximations

CSE202, Lec 13: Rounding of LPs, integrality gaps, and an analysis of set cover

CSE202, Lec 12: Integrality of polyhedra, totally unimodular matrices

CSE202, Lec 11: More on the ellipsoid algorithm

CSE202, Lec 10: Solving LPs

CSE202, Lec 9: The Hungarian algorithm for min weight perfect bipartite matching

CSE202, Lec 8: Primal dual algorithms for mincost flow

CSE202, Lec 7: A deeper look at min cost flow

CSE202, Lec 6: Proof of the max-flow-mincut theorem, introduction to Min cost flow

CSE 202, Lec 5: LP duality

CSE202, Lec 4: Linear programming

CSE 202, Lec 3: Max flow and the Edmonds-Karp algorithm

CSE202, Lec 2: Edmond's blossom algorithm

