On the relationship between ATSP and the cycle cover problem

@article{Chandran2007OnTR,
  title={On the relationship between ATSP and the cycle cover problem},
  author={L. Sunil Chandran and L. Shankar Ram},
  journal={Theor. Comput. Sci.},
  year={2007},
  volume={370},
  pages={218-228}
}
In this paper, we study the relationship between the Asymmetric Traveling Salesman Problem (ATSP) and the Cycle Cover Problem in terms of the strength of the triangle inequality on the edge costs in the given complete directed graph instance, G = (V, E). The strength of the triangle inequality is captured by parametrizing the triangle inequality as follows. A complete directed graph G = (V, E) with a cost function c : E → R is said to satisfy the γ -parametrized triangle inequality if γ (c(u, w… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 19 references

A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem

SIAM J. Comput. • 1979
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…