A Linear Algorithm for the Pos / Neg-Weighted 1-Median Problem on a Cactus

Computing (Vienna/New York)

Volumn 60, Issue 3, 1998, Pages 193-215

  Burkard, R E ^a,b   Krarup, J ^a,c  

^a Institut für Mathematik ^*

^b GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^c UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

1 median problem; Location problems; Obnoxious facilities

Indexed keywords

DECISION THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING;

1-MEDIAN PROBLEM; LOCATION PROBLEMS; OBNOXIOUS FACILITIES;

ALGORITHMS;

EID: 0031652975     PISSN: 0010485X     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02684332     Document Type: Article

References (9)

1. Auletta, V., Parente, D., Persiano, G.: Dynamic and static algorithms for optimal placement of resources in a tree. Theor. Comput. Sci. 165, 441-461 (1996).
2. Bern, M. W., Lawler, E. L., Wong, A.: Linear-time computation of optimal subgraphs of decomposable graphs. J. Algorithms 8, 216-235 (1987).
3. Chen, M.-L., Francis, R. L., Lawrence, J. F., Lowe, T. J., Tufekci, S.: Block-vertex duality and the one-median problem. Networks 15, 395-412 (1985).
4. Courant, R., Robbins, H.: What is Mathematics? Oxford: Oxford University Press 1941.
5. Goldman, A. J.: Optimal center location in simple networks. Transport. Sci. 5, 212-221 (1971).
6. Hakimi, S. L.: Optimum locations of switching centers and the absolute centers and medians of a graph. Oper. Res. 12, 450-459 (1964).
7. Hua, L. K., et al.: Applications of mathematical models to wheat harvesting. Chin. Math. 2, 77-91 (1962).
8. Kariv, O., Hakimi, S. L.: An algorithmic approach to network location problems, Part 2: The p-median. SIAM J. Appl. Math. 37, 539-560 (1979).
9. Krarup, J.: On 'A Complementary Problem; of Courant and Robbins, Report 96/39, DIKU (Dept. of Computer Science, University of Copenhagen). To appear in Location Theory.