Center problems with pos/neg weights on trees

European Journal of Operational Research

Volumn 145, Issue 3, 2003, Pages 483-495

  Burkard, R E ^a   Dollani, Helidon ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Center problem; Location problem; Obnoxious facilities

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; COMPUTER NETWORKS; THEOREM PROVING;

LINEAR TIME ALGORITHMS;

TREES (MATHEMATICS);

EID: 0037448822     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00211-4     Document Type: Article

References (17)

1. Burkard R.E., Krarup J. A linear algorithm for the pos/neg-weighted 1-median problem on a cactus. Computing. 60:1998;193-215.
2. Burkard R.E., Dollani H., Lin Y., Rote G. The obnoxious center problem on a tree. SIAM Journal of Discrete Mathematics. 14:2001;498-509.
3. P. Cappanera, A survey on obnoxious facility location problems, Technical Report: TR-99-11, Department of Computer Science, University of Pisa, April 1999.
4. Dearing P.M., Francis R.L., Lowe T.J. Convex location problems on tree networks. Operations Research. 24:1976;628-642.
5. de Berg M., van Kreveld M., Overmars M., Schwarzkopf O. Computational Geometry: Algorithms and Applications. 1997;Springer, Berlin.
6. Fredman M., Tarjan R. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the Association for Computing Machinery. 34:1987;596-615.
7. Hakimi S.L. Optimal locations of switching centers and the absolute centers and medians of a graph. Operations Research. 12:1964;450-459.
8. Handler G.Y. p-Center problems. Discrete Location Theory. 1990;305-347 Wiley, New York.
9. Kariv O., Hakimi S.L. An algorithmic approach to network location problems. I: The. p -centers SIAM Journal of Applied Mathematics. 37:1979;513-538.
10. Klein C.M., Kincaid R.K. The discrete anti-p-center problem. Transportation Science. 28:1994;77-79.
11. Lan Y.F., Wang Y.L., Suzuki H. A linear-time algorithm for solving the center problem on weighted cactus graphs. Information Processing Letters. 71:1999;205-212.
12. 3 and related problems SIAM Journal of Computing. 12:1983;751-758.
13. 2n) algorithm for the kth longest path in a tree with application to location problems SIAM Journal of Computing. 10:1981;328-337.
14. Overmars M.H., Van Leeuwen J. Maintenance of configurations in the plane. Journal of Computer and System Sciences. 23:1981;166-204.
15. Tamir A. Improved complexity bounds for center location problems on networks by using dynamic data structures. SIAM Journal of Discrete Mathematics. 1:1988;377-396.
16. Tamir A. Obnoxious facility location on graphs. SIAM Journal of Discrete Mathematics. 4:1991;550-567.
17. Tamir A., Zemel E. Locating centers on a tree with discontinuous supply and demand regions. Mathematics of Operations Research. 7:1982;183-197.