YoVDO

Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs

Offered By: IEEE via YouTube

Tags

IEEE FOCS: Foundations of Computer Science Courses Graph Theory Courses Congestion Control Courses

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

Algebra & Algorithms
Moscow Institute of Physics and Technology via Coursera
Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera
Basics of Amazon Detective (Japanese) (日本語吹き替え版)
Amazon Web Services via AWS Skill Builder
Computer Science Fundamentals
Brilliant
Introduction to Linear Algebra
Brilliant