The pos/neg-weighted median problem on block graphs with subgraph-shaped customers
- 65 Downloads
In this paper we consider the pos/neg weighted 1-median problem on block graphs where the customers are modeled as subgraphs. Under the condition that the block graph has unit edge lengths and the median is restricted to the vertex of the block graph, we devise a linear time algorithm for this problem.
KeywordsLocation theory Median problem Subgraph-shaped customers Block graph
Mathematics Subject Classification (2000)90B80
Unable to display preview. Download preview PDF.
- 2.Benkoczi R (2004) Cardinality constrained facility location problems in trees, Ph.D. thesis, Simon Fraser UniversityGoogle Scholar
- 7.Bondy JA, Murty USR (1976) Graph theory with applications. MacMillan, LondonGoogle Scholar
- 10.Kang LY, Cheng YK (2008) The p-maxian problem on block graphs, J Comb Optim doi: 10.1007/s10878-008-9198-1
- 12.Plastria F (2002) Continuous covering location problems. In: Drezner Z, Hamacher HW (eds) Facility location: applications and theory, Chap. 2. Springer, BerlinGoogle Scholar