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

This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms find approximate (slightly suboptimal) solutions to optimization ...

Descriptive set theorists study the niche mathematics of infinity. Now, they’ve shown that their problems can be rewritten in the concrete language of algorithms. All of modern mathematics is built on ...

Northwestern Computer Science alum Yifan Wu (PhD ’25) has received an Honorable Mention for the Association for Computing ...

IBM (NYSE: IBM) and the Massachusetts Institute of Technology today announced the launch of the MIT-IBM Computing Research ...