Exploring Advanced Algorithms Compsci 224 Lecture 11
Exploring Advanced Algorithms Compsci 224 Lecture 11 reveals several interesting facts.
- Scaling for max flow, blocking flow.
- Logistics, course topics, word RAM, predecessor, van Emde Boas, y-fast tries. Please see Problem 1 of Assignment 1 at ...
- Simplex wrap-up, strong duality, complementary slackness, ellipsoid, intro to interior point.
- FPTAS (knapsack), FPRAS (DNF counting), semidefinite programming, Goemans-Williamson MAXCUT
- second order methods (Newton's method), path-following interior point wrap-up.
In-Depth Information on Advanced Algorithms Compsci 224 Lecture 11
Approximation As the John L. Loeb Associate Professor of Engineering and Applied Sciences at the Harvard John A. Paulson School of ... Khintchine, decoupling, Hanson-Wright, proof of distributional JL lemma. Hashing: load balancing, k-wise independence, chaining, linear probing.
Zeta transform, Möbius inversion, streaming
Stay tuned for more updates related to Advanced Algorithms Compsci 224 Lecture 11.