Abstract
We propose a new type of multiple facilities location problem, called the p-service center problem. In this problem, we are to locate p facilities in the graph, each of which provides distinct service required by all vertices. For each vertex, its p-service distance is the summation of its weighted distances to the p facilities. The objective is to minimize the maximum value among the p-service distances of all vertices.
In this paper, we show that the p-service center problem on a general graph is NP-hard, and propose a polynomial-time approximation algorithm. Moreover, we study the basic case pā=ā2 on paths and trees, and provide linear and near-linear time algorithms.
Research supported by the National Science Council, National Taiwan University and Intel Corporation under Grants No. 100-2911-I-002-001, 101-2221-E-005-019, 101-2221-E-005-026, 101-2811-E-005-005, and 101R7501.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ben-Moshe, B., Bhattacharya, B., Shi, Q.: An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.Ā 3887, pp. 166ā177. Springer, Heidelberg (2006)
Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. J. ACMĀ 34, 200ā208 (1987)
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), 10.1007/BFb0028271
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1979)
Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. I: The p-centers. SIAM Journal on Applied MathematicsĀ 37(3), 513ā538 (1979)
Megiddo, N.: Linear-time algorithms for linear programming in R 3 and related problems. SIAM Journal on ComputingĀ 12(4), 759ā776 (1983)
Megiddo, N.: Linear programming in linear time when the dimension is fixed. J. ACMĀ 31, 114ā127 (1984)
PlesnĆk, J.: On the computational complexity of centers locating in a graph. Apl. Mat.Ā 25, 445ā452 (1980)
PlesnĆk, J.: A heuristic for the p-center problems in graphs. Discrete Applied MathematicsĀ 17(3), 263ā268 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yu, HI., Li, CC. (2012). The Multi-Service Center Problem. In: Chao, KM., Hsu, Ts., Lee, DT. (eds) Algorithms and Computation. ISAAC 2012. Lecture Notes in Computer Science, vol 7676. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35261-4_60
Download citation
DOI: https://doi.org/10.1007/978-3-642-35261-4_60
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35260-7
Online ISBN: 978-3-642-35261-4
eBook Packages: Computer ScienceComputer Science (R0)