In Mo Willems’ children’s book Don’t Let the Pigeon Drive the Bus!, the main character—a pigeon, obvs—uses every trick in the book (literally) to convince the reader that it should be allowed to drive ...

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

An infinitesimal advance in the traveling salesman problem breathes new life into the search for improved approximate solutions. The Quanta Newsletter ...

When Nathan Klein started graduate school two years ago, his advisers proposed a modest plan: to work together on one of the most famous, long-standing problems in theoretical computer science. Even ...