Approximate TSP in graphs with forbidden minors

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1853, Issue , 2000, Pages 869-877

  Grigni, Michelangelo ^a  

^a EMORY UNIVERSITY   (United States)

Author keywords

Approximation scheme; Genus; Graph minor; Separator; Spanner; TSP

Indexed keywords

AUTOMATA THEORY; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION; SEPARATORS;

APPROXIMATION SCHEME; EDGE-WEIGHTED GRAPH; GENUS; GRAPH MINORS; NUMBER OF COMPONENTS; QUASI-POLYNOMIAL TIME; SPANNER; TRAVELING SALESPERSON PROBLEM;

GRAPH THEORY;

EID: 84974597124     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_73     Document Type: Conference Paper

References (14)

1. N. Alon, P. D. Seymour, and R. Thomas. A separator theorem for graphs with an excluded minor and its applications. In Proc. 22nd Symp. Theory of Computing, pages 293-299. Assoc. Comput. Mach., 1990.
2. I. Althöfer, G. Das, D. P. Dobkin, D. Joseph, and J. Soares. On sparse spanners of weighted graphs. Discrete Comput. Geom., 9(1):81-100, 1993. An early version appeared in SWAT’90, LNCS V. 447.
3. S. Arora. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. Journal of the ACM, 45(5):753-782, Sept. 1998.
4. S. Arora, M. Grigni, D. Karger, P. Klein, and A. Woloszyn. A polynomial-time approximation scheme for weighted planar graph TSP. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 33-41, San Francisco, California, 25-27 Jan. 1998.
5. S. Arora, M. Grigni, D. Karger, P. Klein, and A. Woloszyn. A polynomial-time approximation scheme for weighted planar graph TSP. In 9th Annual ACM-SIAM Symp. on Discrete Algorithms, pages 33-41, Jan. 1998.
6. N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. In J. F. Traub, editor, Symposium on New Directions and Recent Results in Algorithms and Complexity, page 441, NY, 1976. Academic Press. Also CMU Tech. Report CS-93-13, 1976.
7. R. Diestel. Graph theory. Springer-Verlag, New York, 1997. Translated from the 1996 German original.
8. M. Grigni, E. Koutsoupias, and C. Papadimitriou. An approximation scheme for planar graph TSP. In 36th Annual Symposium on Foundations of Computer Science (FOCS’95), pages 640-645, Los Alamitos, Oct. 1995. IEEE Computer Society Press.
9. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys. The Traveling Salesman Problem. Wiley, 1985, 1992.
10. R. J. Lipton and R. E. Tarjan. A separator theorem for planar graphs. SIAM Journal on Applied Mathematics, 36:177-189, 1979.
11. Mitchell. Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SICOMP: SIAM Journal on Computing, 28, 1999.
12. C. H. Papadimitriou and M. Yannakakis. The traveling salesman problem with distances one and two. Mathematics of Operations Research, 18:1-11, 1993.
13. N. Robertson and P. D. Seymour. Graph minors XVII: Excluding a non-planar graph. Submitted.
14. A. Thomason. An extremal function for contractions of graphs. Math. Proc. Cambridge Philos. Soc., 95(2):261-265, 1984.