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

Computer Networking
Georgia Institute of Technology via Udacity
Cloud Networking
University of Illinois at Urbana-Champaign via Coursera
Packet Switching Networks and Algorithms
University of Colorado System via Coursera
TCP/IP and Advanced Topics
University of Colorado System via Coursera
Master Class : TCP/IP Mechanics from Scratch to Expert
Udemy