The Quanta Podcast

Researchers Achieve 'Absurdly Fast' Algorithm for Network Flow

Sep 28, 2022
Ask episode
Chapters
Transcript
Episode notes
1
Introduction
00:00 • 2min
2
The New Algorithm for Maximum Flow
01:47 • 4min
3
The One Point Five Algorithm
06:07 • 2min
4
Flow Problems in a Contiguous Way
08:28 • 6min
5
Speelman and Tang's Algorithm Runs in Almost Linear Time
14:01 • 2min
6
Quanta Magazine - The Fastest Algorithm for Network Flow
15:57 • 2min