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 ...
JSTOR Daily

Calculating Maximal Flows in a Network with Positive Gains

This paper looks at the maximal-flow-with-gains problem from a new point of view. We wish to discover the maximum output possible for any input. This approach leads naturally to a two-step parametric ...
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 ...
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 ...