半度量图上旅行商问题近似算法的比较
Comparison of approximation algorithms for the travelling salesperson problem on semimetric graphs
摘要:
本文的目的是比较不同的近似算法的旅行推销员问题。我们选择了文献中已知的最流行和最广泛的方法,并将其与我们以前的工作中描述的一种新方法(多边形Christofides算法)进行对比。本文包含一个简要的总结理论背后的算法和高潮的一系列数值模拟(或“实验”),其目的是确定“最佳”近似算法的旅行推销员问题。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。