YoVDO

Unit Capacity Maxflow in Almost m - 4/3 Time

Offered By: IEEE via YouTube

Tags

IEEE FOCS: Foundations of Computer Science Courses Congestion Control Courses Advanced Algorithms Courses Newton's Method Courses

Course Description

Overview

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.

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

Tags

Related Courses

Advanced Algorithms and Complexity
University of California, San Diego via Coursera
NP-Complete Problems
University of California, San Diego via edX
Efficient Zero Knowledge Proof from Interactive Proofs
Simons Institute via YouTube
Dynamic Algorithms for LIS and Distance to Monotonicity
Association for Computing Machinery (ACM) via YouTube
Near-Optimal Decremental SSSP in Dense Weighted Digraphs
IEEE via YouTube