Fixed-Parameter Algorithms for (k, r)-Center in Planar Graphs and Map Graphs

ACM Transactions on Algorithms

Volumn 1, Issue 1, 2005, Pages 33-47

  Demaine, Erik D ^a   Hajiaghayi, Mohammadtaghi ^a   Fomin, Fedor V ^b   Thilikos, Dimitrios M ^c,d  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF BERGEN   (Norway)

^c UNIVERSITY OF ATHENS   (Greece)

^d UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

(k, r) center; Algorithms; Domination; Fixed Parameter algorithms; Graph; Map graph; Planar; Theory

Indexed keywords

EID: 84948770618     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1077464.1077468     Document Type: Article

References (37)

1. Acar, U., Blelloch, G., HARPER, R., Vittes, J., and Woo, S. 2004. Dynamizing static algorithms, with applications to dynamic trees and history independence. In Proceedings of the 15th SODA. ACM Press, New York, NY/SIAM Press, Philadelphia, PA, 531-540.
2. Acar, U., Blelloch, G., and Vittes, J. 2005. Experimental analysis of change propagation in dynamic trees. In Proceedings of the ALENEX05. ACM, Press, New York, NY.
3. Alstrup, S., Holm, J., De Lichtenberg, K., and Thorup, M. 1997. Minimizing diameters of dynamic trees. In Proceedings of the 24th ICALP. Springer, Berlin, Germany, 270-280.
4. Alstrup, S., Holm, J., and Thorup, M. 2000. Maintaining center and median in dynamic trees. In Proceedings of the 7 th SWAT. Lecture Notes in Computer Science, vol. 1851. Springer, Berlin, Germany, 46-56.
5. Auletta, V., Parente, D., and Persiano, G. 1996. Dynamic and static algorithms for optimal placement of resources in a tree. Theor. Comp. Sci. 165, 441-461.
6. Austern, M., Stroustrup, B., Thorup, M., and Wilkinson, J. 2003. Untangling the balancing and searching of balanced binary search trees. Softw.: Pract. Exper. 33, 13, 1273-1298.
7. Battista, G., and Tamassia, R. 1989. Incremental planarity testing. In Proceedings of the 30th FOCS. IEEE. 436-441.
8. Battista, G., and Tamassia, R. 1990. online graph algorithms with SPQR-trees. In Proceedings of the 17th ICALP. Lecture Notes in Computer Science, vol. 443. Springer, Berlin, Germany, 598-611.
9. Cheng, S., and Ng, M. 1996. Isomorphism testing and display of symmetries in dynamic trees. In Proceedings of the 7th SODA. ACM Press, New York, NY/SIAM Press, Philadelphia, PA, 202-211.
10. Cohen, R., and Tamassia, R. 1995. Dynamic expression trees. Algorithmica 13, 3, 245-265.
11. Cohen, R., and Tamassia, R. 1997. Combine and conquer. Algorithmica 18, 3, 324-362.
12. Cohen, R. F., and Tamassia, R. 1991. Dynamic expression trees and their applications. In Proceedings of the 2nd SODA. ACM Press, New York, NY/SIAM Press, Philadelphia, PA, 52-61.
13. Eppstein, D., Galil, Z., Italiano, G. F., and Nissenzweig, A. 1997. Sparsification-A technique for speeding up dynamic graph algorithms. J. ACM 44, 5, 669-696.
14. Even, S., and Kariv, O. 1975. An o(n2 5) algorithm for maximum matching in general graphs. In Proceedings of the 16th FOCS. IEEE, Piscataway, NJ, 100-112.
15. Frederickson, G. 1985. Data structures for online updating of minimum spanning trees, with applications. SIAM J. Comp. 14, 4, 781-798.
16. Frederickson, G. 1997a. Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees. SIAM J. Comp. 26, 2, 484-538. Announced at FOCS'91.
17. Frederickson, G. 1997b. A data structure for dynamically maintaining rooted trees. J. Algorith. 24, 1, 37-65. Announced at SODA'93.
18. Gabow, H. N., Kaplan, H., and Tarjan, R. E. 2001. Unique maximum matching algorithms. J. Algorith. 40, 2, 159-183. Announced at STOC'99.
19. Galil, Z., and Italiano, G. 1991. Maintaining biconnected components of dynamic planar graphs. In Proceedings of the 18th ICALP. Lecture Notes in Computer Science, vol. 510. Springer, Berlin, Germany, 339-350.
20. Goel, A., Indyk, P., and Varadarajan, K. 2001. Reductions among high dimensional proximity problems. In Proceedings of the 10th SODA. ACM Press, New York, NY/SIAM Press, Philadelphia, PA, 769-778.
21. Goldberg, A. V., Grigoriadis, M. D., and Tarjan, R. E. 1991. Use of dynamic trees in a network simplex algorithm for the maximum flow problem. Math. Programm. 50, 277-290.
22. Goldman, A. 1971. Optimal center location in simple networks. Transportat. Sci. 5, 212-221.
23. Henzinger, M. R., and King, V. 2001. Maintaining minimum spanning forests in dynamic graphs. SIAM J. Comput. 31, 2, 364-374.
24. Holm, J., De Lichtenberg, K., and Thorup, M. 2001. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge and biconnectivity. J. ACM 48, 4, 723-760.
25. Kanevsky, A., Tamassia, R., Battista, G. D., and Chen, J. 1991. online maintenance of the four-connected components of a graph. In Proceedings of the 32nd FOCS. IEEE, Press, Los Alamitos, CA, 793-801.
26. La Poutre, J. A. 1991. Dynamic graph algorithms and data structures. Ph.D. dissertation, Department of Computer Science, Utrecht University, Utrecht, the Netherlands.
27. Nardelli, E., Proietti, G., and Widmayer, P. 2001. Finding all the best swaps of a minimum diameter spanning tree under transient edge failures. J. Graph Algorithm. Appl. 5, 5, 39-57.
28. Peckham, S. 1989. Maintaining tree projections in amortized O (log n) time. Tech. rep. TR89-1034. Computer Science Deparment, Cornell University, Ithaca, NY.
29. Poutre, J. A. L. 1992. Maintenance of triconnected components of graphs. In Proceedings of the 19th ICALP. Lecture Notes in Computer Science, vol. 623. Springer, Berlin, Germany, 354-365.
30. Poutre, J. A. L. 1994. Alpha-algorithms for incremental planarity testing. In Proceedings of the 26th STOC. ACM Press, New York, NY, 706-715.
31. Sleator, D., and Tarjan, R. 1983. A data structure for dynamic trees. J. Comput. Syst. Sci. 26, 3, 362-391. Announced at STOC'81.
32. Sleator, D., and Tarjan, R. 1985. Self-adjusting binary search trees. J. ACM 32, 652-686.
33. Tarjan, R. 1997. Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm. Math. Prog. 78, 169-177.
34. Tarjan, R., and Werneck, R. 2005. Self-adjusting top trees. In Proceedings of the 16th SODA. ACM Press, New York, NY/SIAM Press, Philadelphia, PA, 813-822.
35. Thorup, M. 2001. Fully-dynamic min-cut. In Proceedings of the 33rd STOC. ACM Press, New York, NY, 224-230.
36. Thorup, M., and Zwick, U. 2005. Approximate distance oracles. J. ACM 52, 1, 1-24. Announced at STOC'01.
37. Westbrook, J., and Tarjan, R. 1992. Maintaining bridge-connected and biconnected components online. Algorithmica 7, 433-464.