Explore an advanced algorithm for solving unit capacity maxflow problems in nearly m^{4/3} time through this IEEE conference talk. Delve into the Madrid Strategy, Newton's Method, and key concepts such as control congestion and minimax setups as presented by researchers from UC Berkeley and Stanford University. Gain insights into the framework, contributions, and subproblems associated with this cutting-edge approach to network flow optimization.
Overview
Syllabus
Introduction
Why Care
Unit Capacity
Prior Work
Madrid Strategy
Framework
Contributions
Subproblem
Newtons Method
Recap
Control Congestion
Minimax
Minimax setup
Infinity flow problems
Key points
Taught by
IEEE FOCS: Foundations of Computer Science
