Nature

Approximation Algorithms for the Traveling Salesman Problem

The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route planning ...
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

Nathan Klein receives funding from the National Science Foundation. Computers are good at answering questions. What’s the shortest route from my house to Area 51? Is 8,675,309 a prime number? How many ...
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) Test of Time Award at a virtual ceremony on Wednesday 23 June at the ...
mccormick.northwestern.edu

COMP_SCI 437: Approximation Algorithms

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

Topics in Algorithms

This course is available on the MSc in Mathematics and Computation and MSc in Operations Research & Analytics. This course is available with permission as an outside option to students on other ...