无约束旅游竞赛问题是APX完全的
Unconstrained Traveling Tournament Problem is APX-complete
摘要:
我们证明了无约束旅行竞赛问题(UTTP)是APX-完全的,给出了从度量(1,2)-TSP到UTTP的L-约简。关键词:旅行团问题,APX-完全,近似算法,旅行商问题
英文摘要:
We show that the Unconstrained Traveling Tournament Problem (UTTP) is APX-complete by presenting an L-reduction from a version of metric (1,2)-TSP to UTTP. Keywords: Traveling Tournament Problem, APX-complete, Approximation algorithms, Traveling Salesman Problem
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。