A 7/9-Approximation Algorithm for the Maximum Traveling Salesman Problem

被引：0
|
作者：
Paluch, Katarzyna [1 ]
Mucha, Marcin [2 ]
Madry, Aleksander [3 ]
机构：
[1] Univ Wroclaw, Inst Comp Sci, PL-50138 Wroclaw, Poland
[2] Univ Warsaw, PL-00325 Warsaw, Poland
[3] MIT, Cambridge, MA 02139 USA
来源：
APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES | 2009年 / 5687卷
关键词：
IMPROVED APPROXIMATION ALGORITHMS; DISTANCES ONE; TSP; 7/8-APPROXIMATION;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We give a deterministic combinatorial 7/9-approximation algorithm for the symmetric maximum traveling salesman problem.
引用
下载
收藏
页码：298 / +
页数：2
相关论文
共 50 条
  • [41] An LP-based approximation algorithm for the generalized traveling salesman path problem
    Sun, Jian
    Gutin, Gregory
    Li, Ping
    Shi, Peihao
    Zhang, Xiaoyan
    THEORETICAL COMPUTER SCIENCE, 2023, 941 : 180 - 190
  • [42] Probabilistic analysis of an approximation algorithm for the traveling salesman problem on unbounded above instances
    Gimadi E.Kh.
    Gallou A.
    Shakhshneyder A.V.
    Journal of Applied and Industrial Mathematics, 2009, 3 (2) : 207 - 221
  • [43] 3-Approximation algorithm for a two depot, heterogeneous traveling salesman problem
    Sai Yadlapalli
    Sivakumar Rathinam
    Swaroop Darbha
    Optimization Letters, 2012, 6 : 141 - 152
  • [44] 3-Approximation algorithm for a two depot, heterogeneous traveling salesman problem
    Yadlapalli, Sai
    Rathinam, Sivakumar
    Darbha, Swaroop
    OPTIMIZATION LETTERS, 2012, 6 (01) : 141 - 152
  • [45] THE MAXIMUM BENEFIT CHINESE POSTMAN PROBLEM AND THE MAXIMUM BENEFIT TRAVELING SALESMAN PROBLEM
    MALANDRAKI, C
    DASKIN, MS
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1993, 65 (02) : 218 - 234
  • [46] The maximum traveling salesman problem under polyhedral norms
    Barvinok, A
    Johnson, DS
    Woeginger, GJ
    Woodroofe, R
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1998, 1412 : 195 - 201
  • [47] Approximation algorithms for the traveling salesman problem with range condition
    Kumar, DA
    Rangan, CP
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 2000, 34 (03): : 173 - 181
  • [48] Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem
    An, Hyung-Chan
    Kleinberg, Robert D.
    Shmoys, David B.
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2010, 6302 : 1 - +
  • [49] A note on approximation algorithms of the clustered traveling salesman problem
    Bao, Xiaoguang
    Liu, Zhaohui
    Yu, Wei
    Li, Ganggang
    INFORMATION PROCESSING LETTERS, 2017, 127 : 54 - 57
  • [50] A primal-dual approximation algorithm for a two depot heterogeneous traveling salesman problem
    Bae, Jungyun
    Rathinam, Sivakumar
    OPTIMIZATION LETTERS, 2016, 10 (06) : 1269 - 1285
12345