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
基金
美国国家科学基金会;
关键词
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 条