On the LP Relaxation of the Asymmetric Traveling Salesman Path Problem
Theory of Computing, pp. 191-193, 2008
Bibliography with links to cited articles
| [1] | Chandra Chekuri and Martin Pál: An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem. Theory of Computing, 3:197-209, 2007. [ToC:v003/a010]. [ http ] |
This file has been generated by bibtex2html 1.85.