The obnoxious center problem on weighted cactus graphs

Discrete Applied Mathematics

Volumn 136, Issue 2-3, 2004, Pages 377-386

  Zmazek, Blaž ^a,b   Žerovnik, Janez ^a,b  

^a UNIVERSITY OF MARIBOR   (Slovenia)

^b INSTITUTE OF MATHEMATICS   (Slovenia)

Author keywords

Center problem; Linear time algorithm; Location problems; Obnoxious facilities

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER SCIENCE; MULTIPROCESSING SYSTEMS; OPERATIONS RESEARCH; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; TOPOLOGY;

CENTER PROBLEM; LINEAR TIME ALGORITHMS; LOCATION PROBLEM;

GRAPH THEORY;

EID: 0347316859     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00452-9     Document Type: Conference Paper

References (22)

1. Aho A.V., Hopcroft J.E., Ullman J.D. The Design and Analysis of Computer Algorithms. 1974;Addison-Wesley, Reading, MA.
2. Berman O., Drezner Z. A note on the location of an obnoxious facility on a network. European J. Oper. Res. 120:2000;215-217.
3. Bermond J.-C., Comellas F., Hsu D.F. Distributed loop computer networks. a survey J. Parallel Distributed Comput. 24:1995;2-10.
4. Bodlaender H.L. A tourist guide through treewidth. Acta Cybernet. 11:1993;1-21.
5. Brandstädt A., Le V.B., Spinrad J.P. Graph Classes, A Survey. 2000;SIAM, Philadelphia, PA.
6. Buckley F., Harary F. Distance in Graphs. 1990;Addison-Wesley, Redwood, CA.
7. Burkard R.E., Dollani H., Lin Y., Rote G. The obnoxious center problem on a tree. SIAM J. Discrete Math. 14:2001;498-509.
8. Burkard R.E., Krarup J. A linear algorithm for the pos/neg-weighted 1-median problem on Cactus. Comput. 60:1998;193-215.
9. P. Cappanera, A survey on obnoxious facility location problems, Technical Report TR-99-11, Universitá di Pisa, Dipartimento di Informatica, 1999.
10. Daskin M.S. Network and Discrete Location: Models, Algorithms and Applications. 1995;Wiley, New York, NY.
11. Drezdner Z., Wesolowsky G.O. Location of multiple obnoxious facilities. Transportation Sci. 19:1985;193-202.
12. J.F. Fink, B. Elenbogen, Distance distributions for graphs modeling computer science networks, Manuscript 2000.
13. Hedetniemi S.T., Laskar R., Pfaff J. A linear algorithm for finding a minimum dominating set in a cactus. Discrete Appl. Math. 13:1986;287-292.
14. Hosoya H. On some counting polynomials in Chemistry, applications of graphs in Chemistry and Physics. Discrete Appl. Math. 19:1988;239-257.
15. Discrete Math. 80 (1997) (special issue on the Wiener index).
16. Cheng Y., Hwang F.K. Diameters of weighted double loop networks. J. Algorithms. 9:1988;401-410.
17. Juvan M., Mohar B., Žerovnik J. Distance-related invariants on polygraphs. Discrete Appl. Math. 80:1997;57-71.
18. Lan Y.-F., Wang Y.-L., Suzuki H. A linear-time algorithm for solving the center problem on weighted Cactus graphs. Inform. Process. Lett. 71:1999;205-212.
19. Mohar B., Pisanski T. How to compute the Wiener index of a graph. J. Math. Chem. 2:1988;267-277.
20. Sagan B.E., Yeh Y.-N., Zhang P. The Wiener polynomial of a graph. Internat. J. Quantum Chem. 60:1996;959-969.
21. Tamir A. Obnoxious facility location on graphs. SIAM J. Discrete Math. 4:1991;550-567.
22. Žerovnik J., Pisanski T. Computing the diameter in multiple-loop networks. J. Algorithms. 14:1993;226-243.