An O(log ::::n::::) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem

Chandra Chekuri, Martin Pal. An O(log ::::n::::) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem. Theory of Computing, 3(1):197-209, 2007. [doi]

@article{ChekuriP07,
  title = {An O(log ::::n::::) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem},
  author = {Chandra Chekuri and Martin Pal},
  year = {2007},
  doi = {10.4086/toc.2007.v003a010},
  url = {http://dx.doi.org/10.4086/toc.2007.v003a010},
  researchr = {https://researchr.org/publication/ChekuriP07},
  cites = {0},
  citedby = {0},
  journal = {Theory of Computing},
  volume = {3},
  number = {1},
  pages = {197-209},
}