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 条

[31] Three equivalent partial orders on graphs with real edge-weights drawn on a convex polygon
Ito, H
[J]. DISCRETE AND COMPUTATIONAL GEOMETRY, 2005, 3742 : 123 - 130
[32] A nearly linear-time approximation scheme for the euclidean k-median problem
Kolliopoulos, Stavros G.
Rao, Satish
[J]. SIAM JOURNAL ON COMPUTING, 2007, 37 (03) : 757 - 782
[33] A nearly linear-time approximation scheme for the Euclidean k-median problem
Kolliopoulos, SG
Rao, S
[J]. ALGORITHMS - ESA'99, 1999, 1643 : 378 - 389
[34] A LINEAR-TIME SCHEME FOR VERSION RECONSTRUCTION
YU, L
ROSENKRANTZ, DJ
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 519 : 141 - 152
[35] A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs
Cohen-Addad, Vincent
Pilipczuk, Marcin
Pilipczuk, Michal
[J]. 2019 IEEE 60TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2019), 2019, : 560 - 581
[36] A Polynomial-Time Approximation Scheme for Steiner Tree in Planar Graphs
Borradaile, Glencora
Kenyon-Mathieu, Claire
Klein, Philip
[J]. PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2007, : 1285 - 1294
[37] Linear-time algorithm for four-partitioning four-connected planar graphs
Nakano, S.-i.
Rahman, M.S.
Nishizeki, T.
[J]. Information Processing Letters, 1997, 62 (06):
[38] THE HAMILTONIAN CYCLE PROBLEM IS LINEAR-TIME SOLVABLE FOR 4-CONNECTED PLANAR GRAPHS
CHIBA, N
NISHIZEKI, T
[J]. JOURNAL OF ALGORITHMS, 1989, 10 (02) : 187 - 211
[39] A LINEAR-TIME SCHEME FOR VERSION RECONSTRUCTION
YU, L
ROSENKRANTZ, DJ
[J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1994, 16 (03): : 775 - 797
[40] Some interlacing results on weighted adjacency matrices of graphs with degree-based edge-weights
Li, Xueliang
Yang, Ning
[J]. DISCRETE APPLIED MATHEMATICS, 2023, 333 : 110 - 120

← 1 2 3 4 5 →