We present approximation algorithms for almost all variants of the multi-criteria traveling salesman problem (TSP), whose performances are independent of the number $k$ of criteria and come close to the approximation ratios obtained for TSP with a single
展开▼
机译:我们为多准则旅行推销员问题(TSP)的几乎所有变体提供了近似算法,其性能与准则的数量$ k $无关,并且接近于使用单个条件获得的TSP的近似比率
展开▼