A subset spanner for planar graphs, with application to subset TSP

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 749-756

  Klein, Philip N ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

Approximation scheme; Planar graph; Spanner; Traveling salesman problem

Indexed keywords

APPROXIMATION THEORY; PROBLEM SOLVING; SET THEORY;

APPROXIMATION SCHEME; PLANAR GRAPHS; SPANNERS;

TREES (MATHEMATICS);

EID: 33748105775     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. U. A. Acar, G. E. Blelloch, R. Harper, J. L. Vittes, and S. L. M. Woo, "Dynamizing static algorithms, with applications to dynamic trees and history independence," Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 531-540, 2004
2. S. Alstrup, J. Holm, K. D. Lichtenberg, and M. Thorup. "Maintaining information in fully-dynamic trees with top trees," ACM Transactions on Algorithms 1(2), pp, 243-264, 2005.
3. I. Althöfer, G. Das, D. Dobkin, D. Joseph, L. Soares, "On sparse spanners of weighted graphs," Discrete and Computational Geometry, 9, pp. 81-100, 1993.
4. S. Arora, "Polynomial-time approximation schemes for Euclidean TSP and other geometric problems," Journal of the ACM 45, pp. 753-782, 1998.
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. R. F. Cohen, R. Tamassia, "Combine and Conquer," Algorithmica 18(3), pp. 324-362 (1997).
7. G. Das and D. Joseph, "Which triangulations approximate the complete graph?" Proceedings of the International Symposium on Optimal Algorithms, Springer LNCS 401, pp. 168-192, 1989.
8. G. Das, G. Narasimhan, and J. S. Salowe, "A new way to weight malnourished Euclidean graphs," Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 215-222, 1995.
9. E. D. Demaine, 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.
10. G. N. Frederickson, "Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees," SIAM J. Comput 26 (1997), pp. 484-538.
11. 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.
12. M. Grigni, "Approximate TSP in graphs with forbidden minors," Proceedings of the 27th International Colloquium on Automata, Languages, and Programming, pp. 869-877, 2000.
13. P. N. Klein, "Preprocessing an undirected planar network to enable fast approximate distance queries," Proceedings of the 13th Annual ACM-SIAM Symposium On Discrete Algorithms, pages 820-827, 2002.
14. P. N. Klein, "Multiple-source shortest paths in planar graphs," Proceedings of the Sixteenth ACM-SIAM Symposium on Discrete Algorithms, pp. 146-155, 2005.
15. P. N. Klein, "A linear-time approximation scheme for planar weighted tsp," EEE Symposium on Foundations of Computer Science, pp. 647-656, 2005.
16. C. Levcopoulos and A. Lingas, "There are planar graphs almost as good as the complete graphs and as short as minimum spanning trees," Proceedings of the International Symposium on Optimal Algorithms, Springer LNCS 401, pp. 9-13, 1989.
17. J. Mitchell, "Guillotine subdivisions approximate polygonal subdivisions: Part II- a simple PTAS for geometric k-MST, TSP, and related problems," SIAM Journal on Computing 28, pp. 298-1309, 1999.
18. K. Mehlhorn, "A faster approximation algorithm for the Steiner problem in graphs," Information Processing Letters 27(3), pp. 125-128, 1988.
19. C. H. Papadimitriou and M. Yannakakis, "The traveling salesman problem with distances one and two," Mathematics of Operations Research, 18(1), pp. 1-11, 1993.
20. 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.
21. D. D. Sleator and R. E. Tarjan, "A data structure for dynamic trees," Journal of Computer and System Sciences, 26(3), pp. 362-391, 1983.
22. M. Thorup, "Compact oracles for reachability and approximate distances in planar digraphs," Journal of the ACM 51(6), pp. 993-1024, 2004.
23. R. E. Tarjan and R. F. Werneck, "Self-adjusting top trees," Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 813-822, 2005.