Abstract
We consider a common scenario in competitive location, where two competitors (providers) place their facilities (servers) on a network, and the users, which are modeled by the nodes of the network, can choose between the providers. We assume that each user has an inelastic demand, specified by a positive real weight. A user is fully served by a closest facility. The benefit (gain) of a competitor is his market share, i.e., the total weight (demand) of the users served at his facilities.
In our scenario the two providers, called the leader and the follower, sequentially place p and r servers, respectively. After the leader selects the locations for his p servers, the follower will determine the optimal locations for his r servers, that maximize his benefit. An (r,p)-centroid is a set of locations for the p servers of the leader, that will minimize the maximum gain of the follower who can establish r servers.
In this paper we focus mainly on the cases where either the leader or the follower can establish only one facility, i.e., either p=1, or r=1. We consider two versions of the model. In the discrete case the facilities can be established only at the nodes, while in the absolute case they can be established anywhere on the network.
For the (r,1)-centroid problem, we show that it is strongly NP-hard for a general graph, but can be approximated within a factor e/(e−1). On the other hand, when the graph is a tree, we provide strongly polynomial algorithms for the (r,p)-centroid model, whenever p is fixed. For the (1,1)-centroid problem on a general graph, we improve upon known results, and give the first strongly polynomial algorithm. The discrete (1,p)-centroid problem has been known to be NP-hard even for a subclass of series-parallel graphs with pathwidth bounded by 6. In view of this result, we consider the discrete and absolute (1,p) centroid models on a tree, and present the first strongly polynomial algorithms. Further improvements are shown when the tree is a path.
Similar content being viewed by others
References
Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theor. Comput. Sci. 237, 123–134 (2000)
Blum, M., Floyd, R.W., Pratt, V., Rivest, R., Tarjan, R.: Time bounds for selection. J. Comput. Syst. Sci. 7, 448–461 (1973)
Burkard, R., Krarup, J.: A linear algorithm for the pos/neg-weighted 1-median problem on a cactus. Computing 60, 193–215 (1998)
Campos Rodriguez, C.M., Moreno Perez, J.A.: Relaxation of Condorcet and Simpson conditions in voting location. Eur. J. Oper. Res. 145, 673–683 (2003)
Chen, M.-L., Francis, R.L., Lawrence, J.F., Lowe, T.J., Tufekci, S.: Block-vertex duality and the one-median problem. Networks 15, 395–412 (1985)
Edelsbrunner, H.: Algorithms in Combinatorial Geometry. Springer, New York (1987)
Eiselt, H.A., Laporte, G.: Sequential location problems. Eur. J. Oper. Res. 96, 217–231 (1996)
Frederickson, G.N., Johnson, D.B.: The complexity of selection and ranking in X+Y and matrices with sorted columns. J. Comput. Syst. Sci. 24, 197–208 (1982)
Frederickson, G.N., Johnson, D.B.: Finding k-th paths and p-centers by generating and searching good data structures. J. Algorithms 4, 61–80 (1983)
Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 596–615 (1987)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
Hakimi, S.L.: On locating new facilities in a competitive environment. Eur. J. Oper. Res. 12, 29–35 (1983)
Hakimi, S.L.: Locations with spatial interactions: competitive locations and games. In: Mirchandani, P.B., Francis, R.L. (eds.) Discrete Location Theory, pp. 439–478. Wiley-Interscience, New York (1990)
Hansen, P., Labbe, M.: Algorithms for voting and competitive location on a network. Transp. Sci. 22, 278–288 (1988)
Jeger, M., Kariv, O.: Algorithms for finding p-centers on a weighted tree (for a relatively small p). Networks 15, 381–389 (1985)
Kim, T.U., Lowe, T.J., Tamir, A., Ward, J.: On the location of a tree-shaped facility. Networks 28, 167–175 (1996)
Korach, E., Solel, N.: Tree-width, path-width, and cut-width. Discrete Appl. Math. 43, 97–101 (1993)
Megiddo, N.: Combinatorial optimization with rational objective functions. Math. Oper. Res. 4, 414–424 (1979)
Megiddo, N.: Applying parallel computation algorithms in the design of serial algorithms. J. ACM 30, 852–865 (1983)
Megiddo, N., Tamir, A., Zemel, E., Chandrasekaran, R.: An O(nlog2 n) algorithm for the k-th longest path in a tree with applications to location problems. SIAM J. Comput. 10, 328–337 (1981)
Megiddo, N., Zemel, E., Hakimi, L.S.: The maximum coverage location problem. SIAM J. Algebr. Discrete Methods 4, 253–261 (1983)
Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)
Noltemeier, H., Spoerhase, J., Wirth, H.-C.: Multiple voting location and single voting location on trees. Eur. J. Oper. Res. 181, 654–667 (2007)
Slater, P.J.: Maximin facility location. J. Res. Natl. Bur. Stand. B, Math. Sci. 79, 107–115 (1979)
Spoerhase, J.: An optimal algorithm for single maximum coverage location on trees and related problems. In: Proceedings of ISAAC(1), pp. 440–450 (2010)
Spoerhase, J., Wirth, H.-C.: Approximating (r,p)-centroid on a path. In: Proceedings of the 7th Cologne–Twente Workshop on Graphs and Combinatorial Optimization (CTW’08), pp. 193–195 (2008)
Spoerhase, J., Wirth, H.-C.: An O(nlog2 n/loglogn) algorithm for the single maximum coverage location or the (1,X p )-medianoid problem on trees. Inf. Process. Lett. 109, 391–394 (2009)
Spoerhase, J., Wirth, H.-C.: (r,p)-Centroid problems on paths and trees. Theor. Comput. Sci. 410, 5128–5137 (2009)
Tamir, A.: The least element property of center location on tree networks with applications to distance and precedence constrained problems. Math. Program. 62, 475–496 (1993)
Tamir, A.: An O(pn 2) algorithm for the p-median and related problems on tree graphs. Oper. Res. Lett. 19, 59–64 (1996)
Wang, B.-F.: Finding r-dominating sets and p-centers of trees in parallel. IEEE Trans. Parallel Distrib. Syst. 15, 687–698 (2004)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lazar, A., Tamir, A. Improved Algorithms for Some Competitive Location Centroid Problems on Paths, Trees and Graphs. Algorithmica 66, 615–640 (2013). https://doi.org/10.1007/s00453-012-9655-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-012-9655-1