LP duality, line embeddings, and max-flow min-cut
Kent Quanrud · 9:30
This lecture introduces packing and covering linear programs as duals of each other, states that they share the same optimum (LP duality), and uses that fact plus a random line-embedding argument to reprove the max-fl...