Advance Algorithm Lecture 20 Spring 2019

Summary

Flows can be put this is much more general framework and to get the cuts will have to add later on the make the next Okay so I promise that we'll spend the last two Because in general when we start looking at actually analyzing randomized And what it says essentially is I know amplified in light rather than running the whole Reiner's so what is the particular challenge the challenge in many theories about universe beer so all of our Contents: - dual LPs - set cover by dual fitting - primal-dual Linear programming via multiplicative weights, flows, augmenting paths. So today is the 11th 13th then we have basically three more The inputs are still worse is the analysis system worst case the randomization comes from choice with the Randomized paging, packing/covering linear programs, weak duality, approximate complementary slackness, primal/dual online ... Contents: - definition of kernalizations - proof of equivalence to FPT - examples: - simple k^2 kernel for vertex cover - k^2 kernel for ...