Exploring Advanced Algorithms Compsci 224 Lecture 13
Exploring Advanced Algorithms Compsci 224 Lecture 13 reveals several interesting facts.
- Symmetrization, hashing: linear probing (5-wise indep.), bloom filters, cuckoo hashing, bloomier filters.
- Online primal/dual: e/(e-1) ski rental, set cover; approximation
- linear programming: standard form, vertices, bases, simplex.
- Path-following interior point, first order methods (gradient descent).
- Simplex wrap-up, strong duality, complementary slackness, ellipsoid, intro to interior point.
In-Depth Information on Advanced Algorithms Compsci 224 Lecture 13
Guest second order methods (Newton's method), path-following interior point wrap-up. Hashing: load balancing, k-wise independence, chaining, linear probing. Heavy-light decomposition, O(log2n) amortized analysis of link-cut trees, min cost max flow, min cost circulation, shortest ...
Scaling for max flow, blocking flow.
Stay tuned for more updates related to Advanced Algorithms Compsci 224 Lecture 13.