Algorithms
文章平均质量分 91
xiwang_chn
这个作者很懒,什么都没留下…
展开
-
Algorithms - Lecture 12 - Randomized Algorithms
Lecture 12: Randomized Algorithms1 Linearity of Expectation1.1 Expectation E(x)=∑xxP(x)E(x)=\sum_x xP(x)E(x)=∑xxP(x)1.2 E(X+Y)=E(X)+E(Y)E(X+Y)=E(X)+E(Y)E(X+Y)=E(X)+E(Y) for all X,YX, YX,Y1.3 Ex 1, Expected waiting time for heads1.4 Ex 2, A coupon collect原创 2021-03-08 10:37:50 · 243 阅读 · 0 评论 -
Algorithms - Lecture 11 - Linear Programming
Lecture 11: Linear Programming1 Maximum Flow LP1.1 Primal1.2 Dual2 Complementary Slackness3 Minimum-Cost Perfect Matching LP3.1 Primal3.2 Dual 1 Maximum Flow LP 1.1 Primal Maximize ∑(s,v)∈Ex(s,v)−∑(v,s)∈Ex(v,s)\sum_{(s,v)\in E}x_{(s,v)}-\sum_{(v,s)\in E}x_原创 2021-03-08 10:37:37 · 274 阅读 · 0 评论 -
Algorithms - Lecture 10 - Minimum cost perfect matching
Lecture 10: Minimum cost perfect matching1 Definition2 Algorithm2.1 Residual graphDefinition of residual graph GMG_MGMAugmenting paths - Simple directed paths in GMG_MGM2.2 Alternating cyclesSimple directed cycles in GMG_MGM - Alternating cycles in GGGC原创 2021-03-08 10:37:15 · 406 阅读 · 0 评论 -
Algorithms - Lecture 9 - Ford-Fulkerson Analysis & Edmonds-Karp Algorithm
Lecture 9: Push-Relabel Maximum Flow Algorithms1 PreflowsDefinition of preflowsResidual network with respect to a preflow2 Height functions3 Configuration (f,h), L1 no residual path s→ts\rightarrow ts→t4 Generic Push-Relabel algorithm4.1 Initial configurat原创 2021-03-08 10:35:50 · 522 阅读 · 0 评论 -
Algorithms - Lecture 8 - Ford-Fulkerson Analysis & Edmonds-Karp Algorithm
Lecture 8: Ford-Fulkerson Analysis & Edmonds-Karp Algorithm1 Complexity of the Ford-Fulkerson Algorithm2 Edmonds-Karp Maximum Flow Algorithm2.1 High-level idea, (bottleneck)2.2 Bottleneck lemma3 Max-Flow Min-cut theorem 1 Complexity of the Ford-Fulkers原创 2021-03-08 10:33:46 · 129 阅读 · 0 评论