Note on Upper Bounds for TSP Domination Number
Keywords:Traveling salesman problem, domination analysis, complexity, approximation algorithms
AbstractThe domination number, domn(A, n), of a heuristic A for the Asymmetric TSP is the maximum integer d = d(n) such that, for every instance I of the Asymmetric TSP on n cities, A produces a tour T which is not worse than at least d tours in I including T itself. Two upper bounds on the domination number are proved.
How to Cite
Gutin, G., Koller, A., & Yeo, A. (2006). Note on Upper Bounds for TSP Domination Number. Algorithmic Operations Research, 1(1). Retrieved from https://journals.lib.unb.ca/index.php/AOR/article/view/97