Sciweavers

AOR
2006

Note on Upper Bounds for TSP Domination Number

13 years 11 months ago
Note on Upper Bounds for TSP Domination Number
The 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.
Gregory Gutin, Angela Koller, Anders Yeo
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2006
Where AOR
Authors Gregory Gutin, Angela Koller, Anders Yeo
Comments (0)