Computer scientists have written a network flow algorithm that computes almost as fast as is mathematically possible. This algorithm computes the maximum traffic flow with minimum transport costs for ...

Dijkstra's algorithm has long been the quickest way of finding the shortest possible paths in a network, but researchers have discovered an even faster method.

A quantum computer is a machine designed to use quantum mechanics to do things which cannot be done by any machine based only on the laws of classical physics. Eventual applications of quantum ...

If you’ve been making the same commute for a long time, you’ve probably settled on what seems like the best route. But “best” is a slippery concept. Perhaps one day there’s an accident or road closure ...

Long ago computers and machines began to replace blue collar jobs but as creatives we thought we were safe. Have we now reached the tipping point when computers can replace even the photo editor? In ...

Computer programmers have developed a new 'cutting-plane' algorithm, a general-purpose algorithm for solving optimization problems. The algorithm improves on the running time of its most efficient ...

Please provide your email address to receive an email when new articles are posted on . A novel computer-based algorithm can track the progress of hair loss in patients with various types of alopecia, ...

After 44 years, there’s finally a better way to find approximate solutions to the notoriously difficult traveling salesperson problem. When Nathan Klein started graduate school two years ago, his ...

When Nathan Klein started graduate school two years ago, his advisers proposed a modest plan: to work together on one of the most famous, long-standing problems in theoretical computer science. Even ...