A linear-time approximation scheme for planar weighted TSP

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2005, Issue , 2005, Pages 647-656

  Klein, Philip N ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EDGE LENGTHS; LINEAR TIME APPROXIMATION SCHEME; PLANAR GRAPHS;

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; GRAPH THEORY; PROBLEM SOLVING;

ALGORITHMS;

EID: 33748123393     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2005.7     Document Type: Conference Paper

References (24)

1. I. Althöfer, G. Das, D. Dobkin, D. Joseph, L. Soares. On sparse spanners of weighted graphs. Disc. Computational Comp. Geo., 9:1, 1993.
2. S. Arora, "Polynomial-time approximation schemes for Euclidean TSP and other geometric problems," J. ACM 45:753-782, 1998.
3. S. Arora. Polynomial-time approximation schemes for Euclidean TSP and other geometric problems. Proceedings of the 37th Annual IEEE Symp. on Foundations of Computer Science, pp. 2-12, 1996.
4. S. Arora. Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. Proceedings of the 38th Annual IEEE Foundations of Computer Science, pp. 554-563, 1997.
5. S. Arora, M. Grigni, D. R. Karger, P. N. Klein, A. Woloszyn, "A polynomial-time approximation scheme for weighted planar graph TSP," Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 33-41, 1998.
6. B. Baker. Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41:153-180, 1994.
7. Andr Berger, Artur Czumaj, Michelangelo Grigni, and Hairong Zhao. Approximate minimum 2-connected subgraphs in weighted planar graphs. Proceedings of the 13th Annual European Symposium on Algorithms (2005), to appear.
8. H. L. Bodlaender, A linear-time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comp 25:1305-1317, 1996.
9. V. Bouchitt, F. Mazoit, and I. Todinca, "Chordal embeddings of planar graphs," Discrete Mathematics 273:85-102, 2003.
10. D. R. Cheriton, R. E. Tarjan, "Finding minimum spanning trees," SIAM J. Comput. 5: 724-742, 1976.
11. 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, p. 441. Academic Press, NY, 1976.
12. A. Czumaj, M. Grigni, P. Sissokho, and H. Zhao, "Approximation schems for minimum 2-edge-connected and biconnected subgraphs in planar graphs, Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 489-498, 2004.
13. E. D. Demain, M. Hajiaghayi, "Bidimensionality: new connections between FPT algorithms and PTASs," Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 590-601, 2005.
14. D Eppstein, "Subgraph isomorphism in planar graphs and related problems," J. Graph Algorithms and Applications 3:1-27, 1999.
15. M. Grigni, E. Koutsoupias, and C. H. Papadimitriou, "An approximation scheme for planar graph TSP," Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, pp 640-645, 1995.
16. M. Grigni and P. Sissokho, "Light spanners and approximate TSP," Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 852-857, 2002.
17. M. Grigni, "Approximate TSP in graphs with forbidden minors," Proceedings of the 27th International Colloquium on Automata, Languages, and Programming, pp. 869-877, 2000.
18. J. Mitchell, "Guillotine subdivisions approximate polygonal subdivisions: Part II- a simple PTAS for geometric k-MST, TSP, and related problems," SIAM J. Computing 28:298-1309, 1999.
19. D. Lapoire, "Treewidth and duality for planar hypergraphs," unpublished manuscript.
20. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys, The traveling salesman problem, John Wiley, 1985.
21. B. Mohar and C. Thomassen, Graphs on Surfaces The Johns Hopkins University Press, 2001.
22. C. Papadimitriou and M. Yannakakis. Optimization, approximation and complexity classes. J. of Computer and System Sciences 43:425-440, 1991.
23. C. Papadimitriou and M. Yannakakis. The traveling salesman problem with distances one and two. Mathematics of Operations Research 18:1-11, 1993.
24. S. B. Rao and W. D. Smith, "Approximating geometrical graphs via 'spanners' and 'banyans,'" Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 540-550, 1998.