Search

The aim of the paper is to compare different approximation algorithms for the travelling salesperson problem. We pick the most popular and widespread methods known in the literature and contrast them with a novel approach (the polygonal Christofides algorithm) described in our previous work. The paper contains a brief summary of theory behind the algorithms and culminates in a series of numerical simulations (or "experiments"), whose purpose is to determine "the best" approximation algorithm for the travelling salesperson problem., Comment: arXiv admin note: text overlap with arXiv:2105.07275

Following the train of thought from our previous paper we revisit the theorems of Pongsriiam and Termwuttipong by further developing their characterization of certain property-preserving functions using the so-called triangle triplets. We develop more general analogues of disjoint sum lemmas for broader classes of metric-type spaces and we apply these to extend results of Bors\`ik an Dobo\v{s} as well as those obtained by Khemaratchatakumthorn and Pongsriiam. As a byproduct we obtain methods of generating non-trivial and infinite strong $b$-metric spaces which are not metric.