
Researchers Achieve 'Absurdly Fast' Algorithm for Network Flow
The Quanta Podcast
00:00
Introduction
A team of computer scientists has come up with a dramatically faster algorithm for one of the oldest problems in computer science. The maximum flow problem asks, how much material can flow through a network from a source to a destination if the links in the network have capacity limits? Daniel speelman is a mathematics and computer science professor at yale university. Edith cohen is wit gougl research in mountain view, California.
Transcript
Play full episode