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 条
  • [1] An approximation algorithm for the traveling salesman problem with backhauls
    Gendreau, M
    Laporte, G
    Hertz, A
    [J]. OPERATIONS RESEARCH, 1997, 45 (04) : 639 - 641
  • [2] AN APPROXIMATION ALGORITHM FOR A HETEROGENEOUS TRAVELING SALESMAN PROBLEM
    Bae, Jungyun
    Rathinam, Sivakumar
    [J]. PROCEEDINGS OF THE ASME DYNAMIC SYSTEMS AND CONTROL CONFERENCE AND BATH/ASME SYMPOSIUM ON FLUID POWER AND MOTION CONTROL (DSCC 2011), VOL 1, 2012, : 637 - 644
  • [3] An approximation algorithm for the maximum traveling salesman problem
    Hassin, R
    Rubinstein, S
    [J]. INFORMATION PROCESSING LETTERS, 1998, 67 (03) : 125 - 130
  • [4] An approximation algorithm for a bottleneck traveling salesman problem
    Kao, Ming-Yang
    Sanghi, Manan
    [J]. JOURNAL OF DISCRETE ALGORITHMS, 2009, 7 (03) : 315 - 326
  • [5] An approximation algorithm for a bottleneck traveling salesman problem
    Kao, Ming-Yang
    Sanghi, Manan
    [J]. ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 2006, 3998 : 223 - 235
  • [6] A 4/5-Approximation Algorithm for the Maximum Traveling Salesman Problem
    Dudycz, Szymon
    Marcinkowski, Jan
    Paluch, Katarzyna
    Rybicki, Bartosz
    [J]. INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2017, 2017, 10328 : 173 - 185
  • [7] Towards a 4/3 approximation for the asymmetric traveling salesman problem
    Carr, R
    Vempala, S
    [J]. PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 116 - 125
  • [8] An improved approximation algorithm for the clustered traveling salesman problem
    Bao, Xiaoguang
    Liu, Zhaohui
    [J]. INFORMATION PROCESSING LETTERS, 2012, 112 (23) : 908 - 910
  • [9] A constant approximation algorithm for the a priori traveling salesman problem
    Shmoys, David
    Talwar, Kunal
    [J]. INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 2008, 5035 : 331 - +
  • [10] 3-Approximation algorithm for a two depot, heterogeneous traveling salesman problem
    Sai Yadlapalli
    Sivakumar Rathinam
    Swaroop Darbha
    [J]. Optimization Letters, 2012, 6 : 141 - 152
12345