Advertisement

Computing

, Volume 88, Issue 3–4, pp 97–110 | Cite as

The pos/neg-weighted median problem on block graphs with subgraph-shaped customers

  • Xiaoqin Zhang
  • Liying Kang
  • Yukun Cheng
Article

Abstract

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.

Keywords

Location theory Median problem Subgraph-shaped customers Block graph 

Mathematics Subject Classification (2000)

90B80 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aho AV, Hopcropt JE, Ullman JD (1974) The design and analysis of computer algorithms. Addison-Wesdey, ReadingzbMATHGoogle Scholar
  2. 2.
    Benkoczi R (2004) Cardinality constrained facility location problems in trees, Ph.D. thesis, Simon Fraser UniversityGoogle Scholar
  3. 3.
    Benkoczi R, Breton D, Bhattacharya B (2006) Efficient computation of 2-medians in a tree network with positive/negative weights. Discrete Math 306: 1505–1516zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Burkard RE, Cela E, Dollani H (2000) 2-Medians in trees with pos/neg weights. Discrete Appl Math 105: 51–71zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Burkard RE, Fathali J (2007) A polynomial time method for the pos/neg weighted 3-median problem on a tree. Math Meth Oper Res 65: 229–238zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Burkard RE, Krarup J (1998) A linear algorithm for the pos/neg-weighted 1-median problem on a cactus. Computing 60: 193–215zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Bondy JA, Murty USR (1976) Graph theory with applications. MacMillan, LondonGoogle Scholar
  8. 8.
    Cheng YK, Kang LY, Lu CH (2010) The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers. Theor Comp Sci 411: 1038–1044zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Hung RW (2008) Optimal vertex ranking of block graphs. Inform Comput 206: 1288–1302zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Kang LY, Cheng YK (2008) The p-maxian problem on block graphs, J Comb Optim doi: 10.1007/s10878-008-9198-1
  11. 11.
    Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems, Part II p-medians. SIAM J Appl Math 37: 539–560zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Plastria F (2002) Continuous covering location problems. In: Drezner Z, Hamacher HW (eds) Facility location: applications and theory, Chap. 2. Springer, BerlinGoogle Scholar
  13. 13.
    Puerto J, Tamir A, Mesa JA, Pérez-Brito D (2008) Center location problems on tree graphs with subtree-shaped customers. Discrete Appl Math 156: 2890–2910zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Wong PK (1999) Optimal path cover problem on block graphs. Theor Comp Sci 225: 163–169zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag 2010

Authors and Affiliations

  1. 1.Department of MathematicsShanghai UniversityShanghaiPeople’s Republic of China
  2. 2.School of Mathematics and StatisticsZhejiang University of Finance and EconomicsHangzhouPeople’s Republic of China

Personalised recommendations