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

SIAM Journal on Computing

Volumn 37, Issue 6, 2007, Pages 1926-1952

  Klein, Philip N ^a  

^a Brown Univerity   (United States)

Author keywords

Algorithms; Approximation algorithm; Combinatorial optimization; Graphs; Planar graphs; Traveling salesman

Indexed keywords

APPROXIMATION SCHEMES; GRAPHS; PATH METRIC; PLANAR GRAPHS; TRAVELING SALESMAN;

COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; GRAPH THEORY; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 55249098651     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/060649562     Document Type: Conference Paper

References (46)

1. I. ALTHÖFER, G. DAS, D. DOBKIN, D, JOSEPH, AND L. SOARES, On sparse spanners of weighted graphs. Discrete Comput. Geom., 9 (1993), pp. 81-100.
2. S. ARORA, Polynomial time approximation schemes for Euclidean TSP and other geometric problems, J. ACM, 45 (1998), pp. 753-782.
3. S. ARORA, Polynomial time approximation schemes for Euclidean TSP and, other geometric problems, in Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, Burlington, VT, 1996, pp. 2-11.
4. S. ARORA, Nearly linear time approximation schemes for Euclidean TSP and other geometric problems, in Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, Miami, FL, 1997, pp. 554-563.
5. S. ARORA, M. GRIGNI, D. R. KARGER, P. N. KLEIN, AND A. WOLOSZYN, A polynomial-time approximation scheme for weighted planar graph TSP, in Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA), SIAM, Philadelphia, ACM, New York, 1998, pp. 33-41.
6. B. BAKER, Approximation algorithms for NP-complete problems on planar graphs, J. ACM, 41 (1994), pp. 153-180.
7. A. BERGER, A. CZUMAJ, M. GRIGNI, AND H. ZHAO, Approximate minimum 2-connected subgraphs in weighted planar graphs, in Proceedings of the 13th Annual European Symposium on Algorithms, Mallorca, Spain, 2005, pp. 472-483.
8. A. BERGER AND M. GRIGNI, Minimum weight 2-edge-connected spanning subgraphs in planar graphs, in Proceedings of the 34th International Colloquium on Automata, Languages and Programming, 2007, pp. 90-101.
9. H. L. BODLAENDER, Some classes of graph with bounded treewidth, Bull. Eur. Assoc. Theoret. Comput. Sci. EATCS, 36 (1988), pp. 116-126.
10. G. BORRADAILE, C. KENYON-MATHIEU, AND P. KLEIN, A polynomial-time approximation scheme for Steiner tree in planar graphs, in Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (New Orleans, LA), SIAM, Philadelphia, ACM, New York, 2007, pp. 1285-1294.
11. G. BORRADAILE, P. KLEIN, AND C. MATHIEU, Steiner tree in planar graphs: An O(nlogn) approximation scheme with singly exponential dependence on epsilon, in Proceedings of the 10th International Workshop on Algorithms and Data Structures, Lecture Notes in Comput. Sci. 4619, Springer, Berlin, 2007, pp. 275-286.
12. J. M. BOYER AND W. J. MYRVOLD, Simplified planarity, J. Graph Algorithms Appl., 8 (2004), pp. 241-273.
13. D. R. CHERITON AND R. E. TARJAN, Finding minimum spanning trees, SIAM J. Comput., 5 (1976), pp. 724-742.
14. N. CHRISTOFIDES, Worst-case analysis of a new heuristic for the traveling salesman problem, in Symposium on New Directions and Recent Results in Algorithms and Complexity, J. F. Traub, ed., Academic Press, New York, 1976, p. 441.
15. W. J. COOK AND P. D. SEYMOUR, Tour merging via branch-decomposition, INFORMS J. Comput., 15 (2003), pp. 233-248.
16. A. CZUMAJ, M. GRIGNI, P. SISSOKHO, AND H. ZHAO, Approximation schemes for minimum Pledge-connected and biconnected subgraphs in planar graphs, in Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (New Orleans, LA), SIAM, Philadelphia, ACM, New York, 2004, pp. 496-505.
17. E. D. DEMAINE AND M. HAJIAGHAYI, Bidimensionality: New connections between FPT algorithms and PTASs, in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (Vancouver, BC), SIAM, Philadelphia, ACM, New York, 2005, pp. 590-601.
18. E. D. DEMAINE, M. T. HAJIAGHAYI, AND K. KARABAYASHI, Algorithmic graph minor theory: Decomposition, approximation, and coloring, in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, Pittsburgh, PA, 2005, pp. 637-646
19. E. D. DEMAINE, M. HAJIAGHAYI, AND B. MOHAR, Approximation algorithms via contraction decomposition, in Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (New Orleans, LA), SIAM, Philadelphia, ACM, New York, 2007, pp. 278-287.
20. F. DORN, E. PENNINKX, H. L. BODLAENDER, AND F. V. FOMIN, Efficient exact algorithms on planar graphs: Exploiting sphere-cut branch decompositions, in Proceedings of the 13th Annual European Symposium on Algorithms, Mallorca, Spain, 2005, pp. 95-106.
21. J. R. EDMONDS, A combinatorial representation for polyhedral surfaces. Notices Amer. Math. Soc., 7 (1960), p. 646.
22. D. EPPSTEIN, Subgraph isomorphism in planar graphs and related problems. J. Graph Algorithms Appl., 3 (1999), pp. 1-27.
23. M. GRIGNI, E. KOUTSOUPIAS, AND C. H. PAPADIMITRIOU, An approximation scheme for planar graph TSP, in Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, Los Alamitos, CA, 1995, pp. 640-645.
24. M. GRIGNI AND P. SISSOKHO, Light spanners and approximate TSP, in Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA), SIAM, Philadelphia, ACM, New York, 2002, pp. 852-857.
25. M. GRIGNI, Approximate TSP in graphs with forbidden minors, in Proceedings of the 27th International Colloquium on Automata, Languages, and Programming, Geneva, Switzerland, 2000, pp. 869-877.
26. M. GROHE, Local tree-width, excluded minors, and approximation algorithms, Combinatorica, 23 (2003), pp. 613-632.
27. L. HEFFTER, Über das problem der nachbargebiete, Math. Ann., 38 (1891), pp. 477-508.
28. M. R. HENZINGER, P. N. KLEIN, S. RAO, AND S. SUBRAMANIAN, Faster shortest-path algorithms for planar graphs, J. Comput. System Sci., 55 (1997), pp. 3-23.
29. J. HOPCROFT AND R. E. TARJAN, Efficient planarity testing, J. ACM, 21 (1974), pp. 549-568.
30. P. N. KLEIN, A linear-time approximation scheme for planar weighted TSP, in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, Pittsburgh, PA, 2005, pp. 647-657.
31. P. N. KLEIN, A subset spanner for planar graphs, with application to subset TSP, in Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, 2006, pp. 749-756.
32. E. L. LAWLER, J. K. LENSTRA, A. H. G. RINNOOY KAN, AND D. B. SHMOYS, EDS., The Traveling Salesman Problem, John Wiley, Chichester, UK, 1985.
33. D. MARX, On the optimaliiy of planar and geometric approximation schemes, in Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, Providence, RI, 2007, pp. 338-348.
34. J. S. B. MITCHELL, Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric k-MST, TSP, and related problems, SIAM J. Comput., 28 (1999), pp. 1298-1309.
35. B. MOHAR AND C. THOMASSEN, Graphs on Surfaces, The Johns Hopkins University Press, Baltimore, MD, 2001.
36. C. PAPADIMITRIOU AND M. YANNAKAKIS, Optimization, approximation and complexity classes, J. Comput. System Sci., 43 (1991), pp. 425-440.
37. C. PAPADIMITRIOU AND M. YANNAKAKIS, The traveling salesman problem with distances one and two. Math. Oper. Res., 18 (1993), pp. 1-11.
38. S. B. RAO AND W. D. SMITH, Approximating geometrical graphs via "spanners" and "banyans," in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, Dallas, TX, 1998, pp. 540-550.
39. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. III. Planar tree-width, J. Combin. Theory Ser. B, 36 (1984), pp. 49-64.
40. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. IV. Tree-width and well-quasi-ordering, J. Combin. Theory Ser. B, 48 (1990), pp. 227-254.
41. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. X. Obstructions to tree-decomposition, J. Combin. Theory Ser. B, 52 (1991), pp. 153-190.
42. P. D. SEYMOUR AND R. THOMAS, Call routing and the ratcatcher, Combinatorica, 14 (1994), pp. 217-241.
43. R. P. STANLEY, Enumerative Combinatorics, Vol. 1, Cambridge University Press, Cambridge, UK, 2000.
44. K. TALWAR, Bypassing the embedding: Algorithms for low-dimensional metrics, in Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, 2004, pp. 281-290.
45. H. TAMAKI, A linear-time heuristic for the branch-decomposition of planar graphs, in Proceedings of the 11th Annual European Symposium on Algorithms, Budapest, Hungary, 2003, pp. 765-775.
46. J. W. T. YOUNGS, Minimal imbeddings and the genus of a graph, J. Math. Mech., 12 (1963), pp. 303-315.