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 条
  • [1] An approximation algorithm for the maximum traveling salesman problem
    Hassin, R
    Rubinstein, S
    [J]. INFORMATION PROCESSING LETTERS, 1998, 67 (03) : 125 - 130
  • [2] A 7/9-Approximation Algorithm for the Maximum Traveling Salesman Problem
    Paluch, Katarzyna
    Mucha, Marcin
    Madry, Aleksander
    [J]. APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2009, 5687 : 298 - +
  • [3] 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
  • [4] An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices
    Blokh, D
    Levner, E
    [J]. DISCRETE APPLIED MATHEMATICS, 2002, 119 (1-2) : 139 - 148
  • [5] An approximation algorithm for the traveling salesman problem with backhauls
    Gendreau, M
    Laporte, G
    Hertz, A
    [J]. OPERATIONS RESEARCH, 1997, 45 (04) : 639 - 641
  • [6] 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
  • [7] Approximation algorithm for the Traveling Salesman Problem with Backhauls
    Universite de Montreal, Montreal, Canada
    [J]. Oper Res, 4 (639-641):
  • [8] An approximation algorithm for a bottleneck traveling salesman problem
    Kao, Ming-Yang
    Sanghi, Manan
    [J]. JOURNAL OF DISCRETE ALGORITHMS, 2009, 7 (03) : 315 - 326
  • [9] Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem
    Paluch, Katarzyna
    Elbassioni, Khaled
    van Zuylen, Anke
    [J]. 29TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, (STACS 2012), 2012, 14 : 501 - 506
  • [10] An approximation algorithm for a bottleneck traveling salesman problem
    Kao, Ming-Yang
    Sanghi, Manan
    [J]. ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 2006, 3998 : 223 - 235
12345