# click the upper-left icon to select videos from the playlist
source: Tim Roughgarden Lectures 2016年1月11日
A Second Course in Algorithms (CS261, Winter 2016)
CS261 Lecture 1(Goals/Intro to Max Flow) 1:08:17
2 (Edmonds-Karp/Dinic algorithms) 1:18:15
3 (Push-Relabel) 1:16:30
4 (Max Flow Apps) 1:22:28
5 (Min-Cost Matching) 1:21:01
6 (Generalizations) 1:17:09
7 (LP: Intro and Apps) 1:22:33
8 (LP Duality I) 1:20:40
9 (LP Duality II) 1:19:49
10 (Minimax/Simplex) 1:21:21
11 (Multiplicative Weights) 1:24:01
12 (MW/Games/LPs) 1:22:39
13 (Online Algorithms I) 1:13:24
14 (Online Algorithms II) 1:20:55
15 (Approximation Algs) 1:19:56
16 (TSP) 1:11:19
17 (LP+Approx Algs) 1:20:05
18 (Randomized Approx Algs) 1:19:23
19 (Beating Brute Force) 1:18:22
20 (Max Cut/SDP) 1:10:38
1. Clicking ▼&► to (un)fold the tree menu may facilitate locating what you want to find. 2. Videos embedded here do not necessarily represent my viewpoints or preferences. 3. This is just one of my several websites. Please click the category-tags below these two lines to go to each independent website.
No comments:
Post a Comment