Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

AOR
2006

favoriteEmaildiscussreport

74views more AOR 2006»

Note on Upper Bounds for TSP Domination Number

13 years 4 months ago

Note on Upper Bounds for TSP Domination Number

Download www.cs.rhul.ac.uk

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

Real-time Traffic

AOR 2006 | Asymmetric Tsp | Domination Number | Maximum Integer |

claim paper

Related Content

» A generalised upper bound for the ktuple domination number

» The upper bound on ktuple domination numbers of graphs

» A New Upper Bound on the Total Domination Number of a Graph

» Simultaneous graph parameters Factor domination and factor total domination

» Dominating direct products of graphs

» A note on Ramsey numbers with two parameters

» Estimating the number of graphs containing very long induced paths

» New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs

» A Note On SelfShrinking Lagged Fibonacci Generator

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2006
Where	AOR
Authors	Gregory Gutin, Angela Koller, Anders Yeo

Comments (0)