Researchers Achieve ‘Absurdly Fast’ Algorithm for Network Flow

Maximum Flow

A team of computer scientists has come up with a dramatically faster algorithm for one of the oldest problems in computer science: Maximum Flow. The 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. As an example, imagine a network of highways on which you’d like to send as many delivery trucks as possible from Los Angeles to New York City in a given amount of time. The new algorithm is “absurdly fast,” said Daniel Spielman of Yale University. “I was actually inclined to believe … algorithms this good for this problem would not exist.” Read the whole story that started in the 1950s – it sounds as a thriller – Link

This entry was posted in Algortithms, Optimization. Bookmark the permalink.

Leave a Reply

Please log in using one of these methods to post your comment: Logo

You are commenting using your account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s