Search for tag: "aco colloquium"

A constant-factor approximation algorithm for the asymmetric traveling salesman problem - László A. Végh

We give a constant-factor approximation algorithm for the asymmetric traveling salesman problem. Our approximation guarantee is analyzed with respect to the standard LP relaxation, and thus our…

From  Kathryn Gentilello on September 27th, 2017 33 plays 0