Note on Upper Bounds for TSP Domination Number

Gregory Gutin, Koller, A. and Yeo, A.

(2006)

Gregory Gutin, Koller, A. and Yeo, A. (2006) Note on Upper Bounds for TSP Domination Number. Algorithmic Operations Research, 1 (1).

Our Full Text Deposits

Full text access: Open

Full Text - 118.54 KB

Links to Copies of this Item Held Elsewhere

Link to Publisher Copy

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.

Information about this Version

This is a Published version
This version's date is: 2006
This item is not peer reviewed

Link to this Version

https://repository.royalholloway.ac.uk/items/f5112719-7ba6-5a71-c3cf-46d1385c2d7a/1/

Item TypeJournal Article
TitleNote on Upper Bounds for TSP Domination Number
AuthorsGutin, Gregory
Koller, A.
Yeo, A.
DepartmentsFaculty of Science\Computer Science

Identifiers

Deposited by () on 23-Dec-2009 in Royal Holloway Research Online.Last modified on 25-May-2010

Details