A constant-factor approximation algorithm for the asymmetric traveling salesman problem - László A. VéghWe 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
| 38
38 plays
| 0
|
© 2020 Georgia Institute of Technology
video portal by Kaltura