Algorithms for the universal and a priori TSP

被引：22
|
作者：
Schalekamp, Frans [1 ]
Shmoys, David B. [1 ]
机构：
[1] Cornell Univ, Sch ORIE, Ithaca, NY 14853 USA
来源：
OPERATIONS RESEARCH LETTERS | 2008年 / 36卷 / 01期
基金：
美国国家科学基金会;
关键词：
traveling salesman problem; A priori optimization; universal optimization; metric embedding;
D O I：
10.1016/j.orl.2007.04.009
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We present two simple results for generalizations of the traveling salesman problem (TSP): for the universal TSP, we show that one can compute a tour that is universally optimal whenever the input is a tree metric. A (randomized) O(log n)-approximation algorithm for the a priori TSP follows as a corollary. (c) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码：1 / 3
页数：3
相关论文
共 50 条
  • [41] Improved Lower and Upper Bounds for Universal TSP in Planar Metrics
    Hajiaghayi, Mohammad T.
    Kleinberg, Robert
    Leighton, Tom
    PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2006, : 649 - 658
  • [42] Approximation algorithms for orienteering and discounted-reward TSP
    Blum, Avrim
    Chawla, Shuchi
    Karger, David R.
    Lane, Terran
    Meyerson, Adam
    Minkoff, Maria
    SIAM JOURNAL ON COMPUTING, 2007, 37 (02) : 653 - 670
  • [43] Hyper-mutation antibody clone algorithms for TSP
    Du, Wei
    Du, Hai-Feng
    Li, Mao-Lin
    Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University, 2009, 36 (03): : 527 - 534
  • [44] Learning-Augmented Algorithms for Online TSP on the Line
    Gouleakis, Themistoklis
    Lakis, Konstantinos
    Shahkarami, Golnoosh
    THIRTY-SEVENTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 37 NO 10, 2023, : 11989 - 11996
  • [45] Approximation Algorithms for Generalized MST and TSP in Grid Clusters
    Bhattacharya, Binay
    Custic, Ante
    Rafiey, Akbar
    Rafiey, Arash
    Sokol, Vladyslav
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, (COCOA 2015), 2015, 9486 : 110 - 125
  • [46] Approximation algorithms for orienteering and discounted-reward TSP
    Blum, A
    Chawla, S
    Karger, DR
    Lane, T
    Meyerson, A
    Minkoff, M
    44TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2003, : 46 - 55
  • [47] A comparative assessment of ACO algorithms within a TSP environment
    Asmar, DC
    Elshamli, A
    Areibi, S
    DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2005, 1 : 462 - 467
  • [48] An Optimal Lower Bound for Hierarchical Universal Solutions for TSP on the Plane
    Eades, Patrick
    Mestre, Julian
    COMPUTING AND COMBINATORICS (COCOON 2020), 2020, 12273 : 222 - 233
  • [49] Incorporating a priori information into MUSIC-algorithms and analysis
    Linebarger, Darel A., 1600, Elsevier Science B.V., Amsterdam, Netherlands (46):
  • [50] INCORPORATING A-PRIORI INFORMATION INTO MUSIC - ALGORITHMS AND ANALYSIS
    LINEBARGER, DA
    DEGROAT, RD
    DOWLING, EM
    STOICA, P
    FUDGE, GL
    SIGNAL PROCESSING, 1995, 46 (01) : 85 - 104
12345