Skip to main content

Advertisement

Springer Nature Link
Log in

Median problems on wheels and cactus graphs

  • Published:
Computing Aims and scope Submit manuscript

Summary

This paper is dedicated to location problems on graphs. We propose a linear time algorithm for the 1-median problem on wheel graphs. Moreover, some general results for the 1-median problem are summarized and parametric median problems are investigated. These results lead to a solution method for the 2-median problem on cactus graphs, i.e., on graphs where no two cycles have more than one vertex in common. The time complexity of this algorithm is \(\mathcal O(n^2)\), where n is the number of vertices of the graph.

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

  • Burkard R. and 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 

  • Burkard, R., Hatzl, J.: Median problems with positive and negative weights on cycles and cacti. (submitted 2006)

  • Chen M., Francis R., Lawrence J., Lowe T. and Tufekci S. (1985). Block-vertex duality and the one-median problem. Networks 15: 395–412

    Article  MATH  MathSciNet  Google Scholar 

  • Gavsih B. and Sridhar S. (1995). Networks 26: 305–317

    Article  MathSciNet  Google Scholar 

  • Goldman A. (1971). Optimal center location in simple networks. Transp Sci 5: 212–221

    Article  Google Scholar 

  • Hakimi S. (1964). Optimal locations of switching centers and the absolute centers and medians of a graph. Oper Res 12: 450–459

    MATH  Google Scholar 

  • Hua L. (1962). Applications of mathematical methods for wheat harvesting. Chinese Math 2: 77–91

    Google Scholar 

  • Kariv O. and Hakimi S. (1979). An algorithmic approach to network location problems, part II: p-medians. SIAM J Appl Math 27: 539–560

    Article  MathSciNet  Google Scholar 

  • 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

    Google Scholar 

  • Tamir A. (1996). Oper Res Lett 19: 59–64

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management Sciences, University of Waterloo, 200 University Avenue West, Waterloo, ON, Canada, N2L 3G1

    J. Hatzl

Authors
  1. J. Hatzl
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J. Hatzl.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hatzl, J. Median problems on wheels and cactus graphs. Computing 80, 377–393 (2007). https://doi.org/10.1007/s00607-007-0238-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-007-0238-y

AMS Subject Classifications

Keywords