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 ...
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 ...
This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms find approximate (slightly suboptimal) solutions to optimization ...
Metric spaces form the backbone of modern computational geometry by providing a rigorous framework for measuring distances within abstract sets, while geometric approximation algorithms yield ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results