50 search results - page 1 / 10 » Note on Upper Bounds for TSP Domination Number |
AOR
2006
13 years 11 months ago
2006
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 pro...
DM
2008
13 years 11 months ago
2008
In this paper, we provide an upper bound for the k-tuple domination number that generalises known upper bounds for the double and triple domination numbers. We prove that for any ...
EJC
2008
13 years 11 months ago
2008
COMBINATORICS
2007
13 years 11 months ago
2007
DM
2006
13 years 11 months ago
2006
Let F1, F2, . . . , Fk be graphs with the same vertex set V . A subset S V is a factor dominating set if in every Fi every vertex not in S is adjacent to a vertex in S, and a fac...