Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
On the Capture Time of Cops and Robbers Game on a Planar Graph Read chapter Read first chapter

2016 | OriginalPaper | Chapter

The Connected p-Center Problem on Cactus Graphs

Authors : Chunsong Bai, Liying Kang, Erfang Shan

Published in: Combinatorial Optimization and Applications

Publisher: Springer International Publishing

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
previous chapter Convex Independence in Permutation Graphs
next chapter Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
Literature
1.
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)CrossRef
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)
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)MathSciNetCrossRefMATH
5.
Olariu, S.: A simple linear-time algorithm for computing the center of an interval graph. Int. J. Comput. Math. 24, 121–128 (1990)CrossRefMATH
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)MathSciNetCrossRefMATH
7.
Yen, W.C.-K., Chen, C.-T.: The \(p\)-center problem with connectivity constraint. Appl. Math. Sci. 1, 1311–1324 (2007)MathSciNetMATH
8.
Yen, W.C.-K.: The connceted \(p\)-center problem on block graphs with forbidden vertices. Theor. Comput. Sci. 426–427, 13–24 (2012)CrossRefMATH
Metadata
Title
The Connected p-Center Problem on Cactus Graphs
Authors
Chunsong Bai
Liying Kang
Erfang Shan
Copyright Year
2016
Book
Combinatorial Optimization and Applications

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

Electronic ISBN: 978-3-319-48749-6

Copyright Year: 2016

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

Premium Partner

    Image Credits