The Conversation

Planning the best route with multiple destinations is hard even for supercomputers – a new approach breaks a barrier that’s stood for nearly half a century

Computers are good at answering questions. What’s the shortest route from my house to Area 51? Is 8,675,309 a prime number?
mccormick.northwestern.edu

COMP_SCI 437: Approximation Algorithms

This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms ...
Queen Mary University of London

A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries

Mark Jerrum, Alistair Sinclair (UC Berkeley) and Eric Vigoda (Georgia Tech) received the Association for Computing Machinery (ACM ...