Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs
Offered By: IEEE via YouTube
Course Description
Overview
Explore the intricacies of circulation control for faster minimum cost flow in unit-capacity graphs in this 23-minute IEEE conference talk. Delve into the importance of this topic and its applications, examining previous approaches such as Cohen et al. 2017. Understand the direct formulation and the log barrier problem, and learn about electrical circulations. Discover techniques for controlling congestion and improving conductance. Gain insights from MIT and Boston University researchers as they present their findings and discuss open questions in this field of study.
Syllabus
Intro
Minimum Cost Flow in Unit-Capacity Graphs
Why do we care?
How fast?
Previous approach Cohen et al. 2017
A direct formulation
The log barrier problem
Electrical circulations
How to control congestion?
Improving conductance
Recap & Open Questions
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against NatureIEEE via YouTube Computation in the Brain Tutorial - Part 2
IEEE via YouTube Computation in the Brain - Part 1
IEEE via YouTube Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
IEEE via YouTube Cookbook Lower Bounds for Statistical Inference in Distributed and Constrained Settings - Part 1
IEEE via YouTube