Discrete combinatorial optimization has a central role in many scientific disciplines, however, for hard problems we lack linear time algorithms that would allow us to solve very large instances.

If you are planning a trip through several cities and want to find the shortest route, you resort to algorithms, a well-defined sequence of deterministic operations. This article accompanies the ...