Median problems on wheels and cactus graphs

Computing (Vienna/New York)

Volumn 80, Issue 4, 2007, Pages 377-393

  Hatzl, J ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Cactus graphs; Location problem; Median problem; Wheel graphs

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; LINEAR STABILITY ANALYSIS; PARAMETER ESTIMATION; PROBLEM SOLVING; TRACKING (POSITION);

CACTUS GRAPHS; LOCATION PROBLEM; MEDIAN PROBLEMS; WHEEL GRAPHS;

GRAPH THEORY;

EID: 34548403060     PISSN: 0010485X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00607-007-0238-y     Document Type: Article

References (10)

1. Burkard R. and Krarup J. (1998). A linear algorithm for the pos/neg-weighted 1-median problem on a cactus. Computing 60: 193-215
2. Burkard, R., Hatzl, J.: Median problems with positive and negative weights on cycles and cacti. (submitted 2006)
3. Chen M., Francis R., Lawrence J., Lowe T. and Tufekci S. (1985). Block-vertex duality and the one-median problem. Networks 15: 395-412
4. Gavsih B. and Sridhar S. (1995). Networks 26: 305-317
5. Goldman A. (1971). Optimal center location in simple networks. Transp Sci 5: 212-221
6. Hakimi S. (1964). Optimal locations of switching centers and the absolute centers and medians of a graph. Oper Res 12: 450-459
7. Hua L. (1962). Applications of mathematical methods for wheat harvesting. Chinese Math 2: 77-91
8. Kariv O. and Hakimi S. (1979). An algorithmic approach to network location problems, part II: p-medians. SIAM J Appl Math 27: 539-560
9. Mirchandani P. (1990). The p-median problem and generalizations. In: Merchandani, P. and Francis, R. (eds) Discrete location theory, pp 55-117. Wiley, New York
10. Tamir A. (1996). Oper Res Lett 19: 59-64