The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with ...

Nash equilibria represent a cornerstone in game theory, defining strategy profiles wherein no player can benefit by unilaterally ...

This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms ...

Research team debuts the first deterministic streaming algorithms for non-monotone submodular maximization, delivering superior approximation ratios with minimal memory and real-time throughput on ...

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