论文标题
二次订单问题内核，用于由顶点封面编号参数参数的旅行推销员问题
A quadratic-order problem kernel for the traveling salesman problem parameterized by the vertex cover number
论文作者
论文摘要
NP-Hard图形旅行推销员问题（GTSP）是要找到一段封闭的总重量，以访问无方向的边缘加权的每个顶点，而不一定要完整的图形。我们为GTSP提供了一个问题内核，其中$τ$是输入图的顶点覆盖号码。对于任何$α\ geq1 $，对于原始实例，任何$α$ approxproximate解决方案也为原始实例提供了$α$的解决方案。
The NP-hard graphical traveling salesman problem (GTSP) is to find a closed walk of total minimum weight that visits each vertex in an undirected edge-weighted and not necessarily complete graph. We present a problem kernel with $τ^2+τ$ vertices for GTSP, where $τ$ is the vertex cover number of the input graph. Any $α$-approximate solution for the problem kernel also gives an $α$-approximate solution for the original instance, for any $α\geq1$.
