[go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

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

  • Published:
Computing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Aho AV, Hopcropt JE, Ullman JD (1974) The design and analysis of computer algorithms. Addison-Wesdey, Reading

    MATH  Google Scholar 

  2. Benkoczi R (2004) Cardinality constrained facility location problems in trees, Ph.D. thesis, Simon Fraser University

  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–1516

    Article  MATH  MathSciNet  Google Scholar 

  4. Burkard RE, Cela E, Dollani H (2000) 2-Medians in trees with pos/neg weights. Discrete Appl Math 105: 51–71

    Article  MATH  MathSciNet  Google Scholar 

  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–238

    Article  MATH  MathSciNet  Google Scholar 

  6. Burkard RE, Krarup J (1998) A linear algorithm for the pos/neg-weighted 1-median problem on a cactus. Computing 60: 193–215

    Article  MATH  MathSciNet  Google Scholar 

  7. Bondy JA, Murty USR (1976) Graph theory with applications. MacMillan, London

    Google Scholar 

  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–1044

    Article  MATH  MathSciNet  Google Scholar 

  9. Hung RW (2008) Optimal vertex ranking of block graphs. Inform Comput 206: 1288–1302

    Article  MATH  MathSciNet  Google Scholar 

  10. Kang LY, Cheng YK (2008) The p-maxian problem on block graphs, J Comb Optim doi:10.1007/s10878-008-9198-1

  11. Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems, Part II p-medians. SIAM J Appl Math 37: 539–560

    Article  MATH  MathSciNet  Google Scholar 

  12. Plastria F (2002) Continuous covering location problems. In: Drezner Z, Hamacher HW (eds) Facility location: applications and theory, Chap. 2. Springer, Berlin

  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–2910

    Article  MATH  MathSciNet  Google Scholar 

  14. Wong PK (1999) Optimal path cover problem on block graphs. Theor Comp Sci 225: 163–169

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Shanghai University, Shanghai, 200444, People’s Republic of China

    Xiaoqin Zhang, Liying Kang & Yukun Cheng

  2. School of Mathematics and Statistics, Zhejiang University of Finance and Economics, Hangzhou, 310018, People’s Republic of China

    Yukun Cheng

Authors
  1. Xiaoqin Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Liying Kang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yukun Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Liying Kang.

Additional information

Communicated by C.H. Cap.

This research was partially supported by the National Nature Science Foundation of China (No. 10971131), the ShuGuang Plan of Shanghai Education Development Foundation (No. 06SG42) and Shanghai Leading Academic Discipline Project (No. S30104).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, X., Kang, L. & Cheng, Y. The pos/neg-weighted median problem on block graphs with subgraph-shaped customers. Computing 88, 97–110 (2010). https://doi.org/10.1007/s00607-010-0084-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-010-0084-1

Keywords

Mathematics Subject Classification (2000)