Search for tag: "aco colloquium"

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

01:18:56

A constant-factor approximation algorithm for the…

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

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…

aco colloquiumalgorithms combinatorics and optimization (aco)georgia techrecorded by gtlibraryfall 2017
From  Kathryn Gentilello on September 27th, 2017 33 plays 0  
name
László A. Végh
Date
September 21st, 2017