A linear-time approximation scheme for TSP in undirected planar graphs with edge-weights

被引：46
|
作者：
Klein, Philip N. [1 ]
机构：
[1] Brown Univ, Dept Comp Sci, Providence, RI 02912 USA
来源：
SIAM JOURNAL ON COMPUTING | 2008年 / 37卷 / 06期
关键词：
algorithms; combinatorial optimization; graphs; planar graphs; approximation algorithm; traveling salesman;
D O I：
10.1137/060649562
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We give an algorithm requiring O(c(1/epsilon 2) n) time to find an epsilon-optimal traveling salesman tour in the shortest-path metric defined by an undirected planar graph with nonnegative edgelengths. For the case of all lengths equal to 1, the time required is O(c(1/epsilon 2) n).
引用
收藏
页码：1926 / 1952
页数：27
相关论文
共 50 条
  • [1] A linear-time approximation scheme for planar weighted TSP
    Klein, PN
    [J]. 46TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2005, : 647 - 656
  • [2] A LINEAR-TIME ALGORITHM FOR EDGE-DISJOINT PATHS IN PLANAR GRAPHS
    WAGNER, D
    WEIHE, K
    [J]. COMBINATORICA, 1995, 15 (01) : 135 - 150
  • [3] New Linear-Time Algorithms for Edge-Coloring Planar Graphs
    Richard Cole
    Łukasz Kowalik
    [J]. Algorithmica, 2008, 50 : 351 - 368
  • [4] New linear-time algorithms for edge-coloring planar graphs
    Cole, Richard
    Kowalik, Lukasz
    [J]. ALGORITHMICA, 2008, 50 (03) : 351 - 368
  • [5] Labelings of graphs with fixed and variable edge-weights
    Babilon, Robert
    Jelinek, Vit
    Kral, Daniel
    Valtr, Pavel
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2007, 21 (03) : 688 - 706
  • [6] A linear time approximation scheme for Euclidean TSP
    Bartal, Yair
    Gottlieb, Lee-Ad
    [J]. 2013 IEEE 54TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2013, : 698 - 706
  • [7] A Linear-Time Approximation Algorithm for Weighted Matchings in Graphs
    Vinkemeier, Doratha E. Drake
    Hougardy, Stefan
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2005, 1 (01) : 107 - 122
  • [8] Linear-Time Approximation Algorithms for Unit Disk Graphs
    da Fonseca, Guilherme D.
    Pereira de Sa, Vinicius G.
    de Figueiredo, Celina M. H.
    [J]. APPROXIMATION AND ONLINE ALGORITHMS, WAOA 2014, 2015, 8952 : 132 - 143
  • [9] ON LINEAR-TIME ALGORITHMS FOR 5-COLORING PLANAR GRAPHS
    FREDERICKSON, GN
    [J]. INFORMATION PROCESSING LETTERS, 1984, 19 (05) : 219 - 224
  • [10] A linear-time algorithm for clique-coloring planar graphs
    Liang, Zuosong
    Shan, Erfang
    Xing, Huiyu
    Bai, Chunsong
    [J]. OPERATIONS RESEARCH LETTERS, 2019, 47 (04) : 241 - 243
12345