Exploring Advanced Algorithms Compsci 224 Lecture 11
Exploring Advanced Algorithms Compsci 224 Lecture 11 reveals several interesting facts.
- Power of random signs: ℓ2 norm estimation, subspace embeddings (regression), Johnson-Lindenstrauss, deterministic point ...
- Online primal/dual: e/(e-1) ski rental, set cover; approximation
- Path-following interior point, first order methods (gradient descent).
- Symmetrization, hashing: linear probing (5-wise indep.), bloom filters, cuckoo hashing, bloomier filters.
- Online
In-Depth Information on Advanced Algorithms Compsci 224 Lecture 11
Approximation Scaling for max flow, blocking flow. Guest Fusion trees, word-level parallelism, most significant set bit in constant time.
FPTAS (knapsack), FPRAS (DNF counting), semidefinite programming, Goemans-Williamson MAXCUT
Stay tuned for more updates related to Advanced Algorithms Compsci 224 Lecture 11.