Note on Upper Bounds for TSP Domination Number

Gregory Gutin, Angela Koller, Anders Yeo

Abstract


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.

Keywords


Traveling salesman problem; domination analysis; complexity; approximation algorithms

Full Text:

PDF


Algorithmic Operations Research. ISSN: 1718-3235