A note on the traveling salesman reoptimization problem under vertex insertion

被引：7
|
作者：
Monnot, Jerome [1 ,2 ]
机构：
[1] CNRS, UMR 7243, F-75700 Paris, France
[2] Univ Paris 09, PSL, LAMSADE, F-75775 Paris 16, France
来源：
INFORMATION PROCESSING LETTERS | 2015年 / 115卷 / 03期
关键词：
Approximation algorithms; Reoptimization under vertex insertion; TSP; HARDNESS; WEIGHT;
D O I：
10.1016/j.ipl.2014.11.003
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We propose a 4/3-approximation in linear time for the metric traveling salesman reoptimization problem under vertex insertion. This constitutes an improvement of the time complexity of the best known existing bound since in Ausiello et al. (2009) [5] a 4/3-approximation is already given with a complexity O(n(3)). Our algorithm is of independent interest because it does not use a matching to build the approximate solution. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码：435 / 438
页数：4
相关论文
共 50 条
12345