The approximation ratio of the greedy algorithm for the metric traveling salesman problem

被引：6
|
作者：
Brecklinghaus, Judith [1 ]
Hougardy, Stefan [1 ]
机构：
[1] Univ Bonn, Res Inst Discrete Math, D-53113 Bonn, Germany
来源：
OPERATIONS RESEARCH LETTERS | 2015年 / 43卷 / 03期
关键词：
Traveling salesman problem; Greedy algorithm; Clarke-Wright savings heuristic; Approximation algorithm;
D O I：
10.1016/j.orl.2015.02.009
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We prove that the approximation ratio of the greedy algorithm for the metric Traveling Salesman Problem is Theta (log n). Moreover, we prove that the same result also holds for graphic, euclidean, and rectilinear instances of the Traveling Salesman Problem. Finally we show that the approximation ratio of the Clarke-Wright savings heuristic for the metric Traveling Salesman Problem is (9 (log n). (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码：259 / 261
页数：3
相关论文
共 50 条
  • [1] The approximation ratio of the 2-Opt Heuristic for the metric Traveling Salesman Problem
    Hougardy, Stefan
    Zaiser, Fabian
    Zhong, Xianghui
    [J]. OPERATIONS RESEARCH LETTERS, 2020, 48 (04) : 401 - 404
  • [2] An approximation algorithm for the traveling salesman problem with backhauls
    Gendreau, M
    Laporte, G
    Hertz, A
    [J]. OPERATIONS RESEARCH, 1997, 45 (04) : 639 - 641
  • [3] 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
  • [4] An approximation algorithm for the maximum traveling salesman problem
    Hassin, R
    Rubinstein, S
    [J]. INFORMATION PROCESSING LETTERS, 1998, 67 (03) : 125 - 130
  • [5] An approximation algorithm for a bottleneck traveling salesman problem
    Kao, Ming-Yang
    Sanghi, Manan
    [J]. JOURNAL OF DISCRETE ALGORITHMS, 2009, 7 (03) : 315 - 326
  • [6] An approximation algorithm for a bottleneck traveling salesman problem
    Kao, Ming-Yang
    Sanghi, Manan
    [J]. ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 2006, 3998 : 223 - 235
  • [7] A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem
    van Bevern, Rene
    Slugina, Viktoriia A.
    [J]. HISTORIA MATHEMATICA, 2020, 53 : 118 - 127
  • [8] Greedy Permuting Method for Genetic Algorithm on Traveling Salesman Problem
    Liu, Junjun
    Li, Wenzheng
    [J]. 2018 8TH INTERNATIONAL CONFERENCE ON ELECTRONICS INFORMATION AND EMERGENCY COMMUNICATION (ICEIEC), 2018, : 47 - 51
  • [9] An improved approximation algorithm for the clustered traveling salesman problem
    Bao, Xiaoguang
    Liu, Zhaohui
    [J]. INFORMATION PROCESSING LETTERS, 2012, 112 (23) : 908 - 910
  • [10] A constant approximation algorithm for the a priori traveling salesman problem
    Shmoys, David
    Talwar, Kunal
    [J]. INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 2008, 5035 : 331 - +
12345