Year: 2025
Type: article
Abstract: One way to speed up the calculation of optimal traveling salesman problem tours in practice is eliminating edges that are certainly not in the optimal tour as a preprocessing step. In order to do so, several edge elimination approaches have been proposed in the past. In this work, we investigate two of them in the scenario where the input consists of n independently distributed random points in the two-dimensional unit square with density function bounded from above and below by arbitrary positive constants. We show that after the edge elimination procedure of Hougardy and Schroeder, the expected number of remaining edges is [Formula: see text], whereas after the nonrecursive part of Jonker and Volgenant, the expected number of remaining edges is [Formula: see text].
Author: Xianghui Zhong
Institution: University of Bonn
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4408658445