Computer Science – Computational Geometry
Scientific paper
2002-09-23
Computer Science
Computational Geometry
8 pages, 5 charts
Scientific paper
The well-known $O(n^{1-1/d})$ behaviour of the optimal tour length for TSP in
d-dimensional Cartesian space causes breaches of the triangle inequality. Other
practical inadequacies of this model are discussed, including its use as basis
for approximation of the TSP optimal tour length or bounds derivations, which I
attempt to remedy.
No associations
LandOfFree
Remarks on d-Dimensional TSP Optimal Tour Length Behaviour does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Remarks on d-Dimensional TSP Optimal Tour Length Behaviour, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Remarks on d-Dimensional TSP Optimal Tour Length Behaviour will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-612404