Obnoxious centers in graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 98-107

  Cabello, Sergio ^a   Rote, Günter ^b  

^a UNIVERSITY OF LJUBLJANA   (Slovenia)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPHIC METHODS;

ARBITRARY GRAPHS; BOUNDED TREEWIDTH; COMPUTING DISTANCES; EXPECTED TIME; PLANAR GRAPH; RANDOMIZED ALGORITHMS; WORSTCASE;

GRAPH THEORY;

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

References (23)

1. B. Ben-Moshe, B. K. Bhattacharya, and Q. Shi. Efficient algorithms for the weighted 2-center problem in a cactus graph. In Algorithms and Computation: ISAAC 2005, volume 3827 of Lecture Notes in Computer Science, pages 693-703. Springer-Verlag, 2005.
2. H. L. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput., 25(6):1305-1317, 1996.
3. H. L. Bodlaender. Treewidth: Algorithmic techniques and results. In Proceedings MFCS'97, volume 1295 of Lecture Notes in Computer Science, pages 19-36. Springer-Verlag, 1997.
4. H. L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci., 209:1-45, 1998.
5. H. L. Bodlaender and T. Hagerup. Parallel algorithms with optimal speedup for bounded treewidth. SIAM J. Comput., 27(6):1725-1746, 1998.
6. R. E. Burkard, H. Dollani, Y. Lin, and G. Rote. The obnoxious center problem on a tree. SIAM Journal on Discrete Mathematics, 14:498-509, 2001.
7. S. Chaudhuri and C. D. Zaroliagis. Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms. Theoretical Computer Science, 203:205-223, 1998.
8. S. Chaudhuri and C. D. Zaroliagis. Shortest paths in digraphs of small treewidth. Part I: Sequential algorithms. Algorithmica, 27:212-226, 2000.
9. R. Cole. Slowing down sorting networks to obtain faster sorting algorithms. J. ACM, 34(1):200-208, 1987.
10. J. Fakcharoenphol and S. Rao. Planar graphs, negative weight edges, shortest paths, and near linear time. J. Comput. Syst. Sci., 72:868-889, 2006.
11. M.R. Henzinger, P.N. Klein, S. Rao, and S. Subramanian. Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci., 55(1):3-23, 1997.
12. M. J. Katz, K. Kedem, and M. Segal. Improved algorithms for placing undesirable facilities. Computers and Operations Research, 29:1859-1872, 2002.
13. P. N. Klein. Multiple-source shortest paths in planar graphs. In Proc. 16th ACM-SIAM Sympos. Disc. Alg. (SODA), pages 146-155, 2005.
14. R. J. Lipton and R. E. Tarjan. A separator theorem for planar graphs. SIAM J. Appl. Math., 36:177-189, 1979.
15. N. Megiddo. Combinatorial optimization with rational objective functions. Math. Oper. Res, 4(4):414-424, 1979.
16. N. Megiddo. Applying parallel computation algorithms in the design of serial algorithms. J. ACM, 30(4):852-865, 1983.
17. 3 and related problems. SIAM J. Comput., 12:759-776, 1983.
18. G. L. Miller. Finding small simple cycle separators for 2-connected planar graphs. J. Comput. Syst. Sci., 32:265-279, 1986.
19. B.A. Reed. Finding approximate separators and computing tree width quickly. In STOC '92: Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, pages 221-228, 1992.
20. A. Tamir. Improved complexity bounds for center location problems on networks by using dynamic data structures. SIAM J. Discrete Math., 1:377-396, 1988.
21. A. Tamir. Obnoxious facility location on graphs. SIAM J. Discrete Math., 4:550-567, 1991.
22. A. Tamir. Locating two obnoxious facilities using the weighted maximin criterion. Operations Research Letters, 34:97-105, 2006.
23. B. Zmazek and J. Žerovnik. The obnoxious center problem on weighted cactus graphs. Discrete Appl. Math., 136:377-386, 2004.