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

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

In this paper we introduce two general techniques for the design and analysis of approximation algorithms for NP-hard scheduling problems in which the objective is to minimize the weighted sum of the ...

After 44 years, there’s finally a better way to find approximate solutions to the notoriously difficult traveling salesperson problem. When Nathan Klein started graduate school two years ago, his ...