NextBigFuture

MIT, Yale and USC have a better max-flow algorithm which improve networks and logistics

The maximum-flow problem, or max flow, is one of the most basic problems in computer science. MIT researchers, together with colleagues at Yale and the University of Southern California, have ...

Algorithms, not GPUs, are the real force multipliers and this Infosys Prize winner proves it

Sachdeva’s breakthrough challenges one of the most studied problems in computer science, known as maximum flow, which ...
PC World

MIT’s new algorithm could solve thorny optimization problems

A group of researchers at the Massachusetts Institute of Technology have devised a potentially more effective way of helping computers solve some of the toughest optimization problems they face. Their ...
Live Science

'Absurdly fast' algorithm solves 70-year-old logjam — speeding up network traffic in areas from airline scheduling to the internet

Network slowdowns could soon be a thing of the past, thanks to a superfast new algorithm. The breakthrough offers a dramatically faster solution to a problem that has been plaguing computer scientists ...
Nature

Network Design Problems and Algorithms

Network design problems constitute a critical area in operations research and engineering, where the objective is to construct or upgrade network infrastructures optimally under a range of constraints ...