In 1996, Dor, Halperin, and Zwick introduced an influential method that delivered a “2-approximation” in nearly optimal time.

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

A subplan is an optional enhancement to the Professional MS in Computer Science (MSCPS) degree program allowing students to demonstrate a high level of expertise in a sub-field of Computer Science.

Since the very first days of computer science — a field known for its methodical approach to problem-solving — randomness has played an important role. The first program to run on the world’s first ...

This is an introductory graduate level course on Algorithms that will give broad exposure to recent advances in algorithms, yet cover the fundamental techniques needed to understand the recent ...