Skip to main content
SpringerLink
Log in

The Connected p-Center Problem on Cactus Graphs

  • Conference paper
  • First Online:
Combinatorial Optimization and Applications (COCOA 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10043))

  • 1184 Accesses

Abstract

In this paper, we study a variant of the p-center problem on cactus graphs in which the p-center is asked to be connected, and this problem is called the connected p-center problem. For the connected p-center problem on cactus graphs, we propose an dynamic programming algorithm and show that the time complexity is \(O(n^2p^2)\), where n is number of vertices.

Research was partially supported by NSFC (grant numbers 11571222, 11471210).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Burkard, R.E., Krarup, J.: A linear algorithm for the pos/neg-weighted 1-median problem on cactus. Computing 60, 498–509 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  2. Frederickson, G.: Parametric search and locating supply centers in trees. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1991. LNCS, vol. 519, pp. 299–319. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  3. Garey, M.R., Johnso, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Bell Laboratories, Murray Hill, Freeman & Co., New York (1978)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Olariu, S.: A simple linear-time algorithm for computing the center of an interval graph. Int. J. Comput. Math. 24, 121–128 (1990)

    Article  MATH  Google Scholar 

  6. Tamir, A.: Improved complexity bounds for center location problems on networks by using dynamic data structures. SIAM J. Discrete Math. 1, 377–396 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  7. Yen, W.C.-K., Chen, C.-T.: The \(p\)-center problem with connectivity constraint. Appl. Math. Sci. 1, 1311–1324 (2007)

    MathSciNet  MATH  Google Scholar 

  8. Yen, W.C.-K.: The connceted \(p\)-center problem on block graphs with forbidden vertices. Theor. Comput. Sci. 426–427, 13–24 (2012)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fuyang Normal College, Fuyang, 236041, P.R. China

    Chunsong Bai

  2. Department of Mathematics, Shanghai University, Shanghai, 200444, P.R. China

    Liying Kang

  3. School of Management, Shanghai University, Shanghai, 200444, P.R. China

    Erfang Shan

Authors
  1. Chunsong Bai
    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. Erfang Shan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Erfang Shan .

Editor information

Editors and Affiliations

  1. University of Hong Kong, Hong Kong, China

    T-H. Hubert Chan

  2. City University of Hong Kong, Hong Kong, China

    Minming Li

  3. City University of Hong Kong, Hong Kong, China

    Lusheng Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Bai, C., Kang, L., Shan, E. (2016). The Connected p-Center Problem on Cactus Graphs. In: Chan, TH., Li, M., Wang, L. (eds) Combinatorial Optimization and Applications. COCOA 2016. Lecture Notes in Computer Science(), vol 10043. Springer, Cham. https://doi.org/10.1007/978-3-319-48749-6_53

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-48749-6_53

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-48748-9

  • Online ISBN: 978-3-319-48749-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation