An approximation algorithm for the maximum traveling salesman problem

被引：0
|
作者：
Dept. of Stat. and Operations Res., School of Mathematical Sciences, Tel-Aviv University, Tel-Aviv 69978, Israel [1 ]
机构：
来源：
Inf. Process. Lett. | / 3卷 / 125-130期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We develop a polynomial time approximation algorithm for the maximum traveling salesman problem. It guarantees a solution value of at least r times the optimal one for any given r less than or equal 5/7. © 1998 Elsevier Science B.V. All rights reserved.
引用
收藏
相关论文
共 50 条
  • [41] 3-Approximation algorithm for a two depot, heterogeneous traveling salesman problem
    Sai Yadlapalli
    Sivakumar Rathinam
    Swaroop Darbha
    [J]. Optimization Letters, 2012, 6 : 141 - 152
  • [42] Probabilistic analysis of an approximation algorithm for the traveling salesman problem on unbounded above instances
    Gimadi E.Kh.
    Gallou A.
    Shakhshneyder A.V.
    [J]. Journal of Applied and Industrial Mathematics, 2009, 3 (2) : 207 - 221
  • [43] An LP-based approximation algorithm for the generalized traveling salesman path problem
    Sun, Jian
    Gutin, Gregory
    Li, Ping
    Shi, Peihao
    Zhang, Xiaoyan
    [J]. THEORETICAL COMPUTER SCIENCE, 2023, 941 : 180 - 190
  • [44] 3-Approximation algorithm for a two depot, heterogeneous traveling salesman problem
    Yadlapalli, Sai
    Rathinam, Sivakumar
    Darbha, Swaroop
    [J]. 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
    [J]. 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
    [J]. INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1998, 1412 : 195 - 201
  • [47] Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem
    An, Hyung-Chan
    Kleinberg, Robert D.
    Shmoys, David B.
    [J]. APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2010, 6302 : 1 - +
  • [48] Approximation algorithms for the traveling salesman problem with range condition
    Kumar, DA
    Rangan, CP
    [J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 2000, 34 (03): : 173 - 181
  • [49] A note on approximation algorithms of the clustered traveling salesman problem
    Bao, Xiaoguang
    Liu, Zhaohui
    Yu, Wei
    Li, Ganggang
    [J]. 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
    [J]. OPTIMIZATION LETTERS, 2016, 10 (06) : 1269 - 1285
12345