A 3/4 Differential Approximation Algorithm for Traveling Salesman Problem

被引：0
|
作者：
Amano, Yuki [1 ]
Makino, Kazuhisa [1 ]
机构：
[1] Kyoto Univ, Res Inst Math Sci, Kyoto, Japan
来源：
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2022 | 2022年 / 13571卷
关键词：
Approximation algorithms; Differential approximation; Traveling salesman problem; TSP;
D O I：
10.1007/978-3-031-20350-3_19
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper, we consider differential approximability of the traveling salesman problem (TSP). The differential approximation ratio was proposed by Demange and Paschos in 1996 as an approximation criterion that is invariant under affine transformation of the objective function. We show that TSP is 3/4-differential approximable, which improves the currently best known bound 3/4- O(1/n) due to Escoffier and Monnot in 2008, where n denotes the number of vertices in the given graph.
引用
收藏
页码：237 / 248
页数：12
相关论文
共 50 条
12345