Computer scientists are abuzz over a fast new algorithm for solving one of the central problems in the field.

The new algorithm solves these two problems in “almost linear” time, which means that the algorithm’s runtime is roughly proportional to the amount of time it takes merely to write down the details of ...

Dimitri P. Bertsekas, The Auction Algorithm for Assignment and Other Network Flow Problems: A Tutorial, Interfaces, Vol. 20, No. 4, The Practice of Mathematical ...

The library sorting problem is used across computer science for organizing far more than just books. A new solution is less than a page-width away from the theoretical ideal.

When we tested our algorithms with the widely used sample data sets, we were surprised at how well they performed relative to open-source algorithms assembled by IBM.

We describe an algorithm for the 0-1 knapsack problem (KP), which relies mainly on three new ideas. The first one is to focus on what we call the core of the problem, namely, a knapsack problem ...

If new research from the University of Toronto is to be believed, all your common fashion problems can be solved with the help of an algorithm. Yes, the research team have come up with a computer ...