Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs

@inproceedings{Feige2007ImprovedAR,
  title={Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs},
  author={Uriel Feige and Mohit Singh},
  booktitle={APPROX-RANDOM},
  year={2007}
}
In metric asymmetric traveling salesperson problems the input is a complete directed graph in which edge lengths satisfy the triangle inequality, and one is required to find a minimum length walk that visits all vertices. In ATSP the walk is required to be cyclic. In asymmetric traveling salesperson path problem (ATSPP), the walk is required to start at vertex s and to end at vertex t. We improve the approximation ratio for ATSP from 43 log3 n ' 0.842 log2 n to 23 log2 n. This improvement is… CONTINUE READING
49 Extracted Citations
8 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Similar Papers

Loading similar papers…