New algorithm could boost the efficiency even of huge networks like the Internet
January 7, 2014
Finding the most efficient way to transport items across a network like the U.S. highway system or the Internet is a problem that has taxed mathematicians and computer scientists for decades.
As the size of networks like the Internet has grown exponentially, it is often prohibitively time-consuming to solve these problems using traditional computing techniques.
In a paper to be presented at this week's ACM-SIAM Symposium on Discrete Algorithms in Portland, Ore., a team featuring CSAIL Principal Investigator Jonathan Kelner will describe a new theoretical algorithm that can dramatically reduce the number of operations needed to solve the max-flow problem, making it possible to tackle even huge networks like the Internet or the human genome.