Abstract
This paper studies a new version of the location problem called the mixed center location problem. Let P be a set of n points in the plane. We first consider the mixed 2-center problem where one of the centers must be in P and solve it in \(O(n^2\log n)\) time. Next we consider the mixed k-center problem where m of the centers are in P. Motivated by two practical constraints, we propose two variations of the problem. We present an exact algorithm, a 2-approximation algorithm and a heuristic algorithm solving the mixed k-center problem. The time complexity of the exact algorithm is \(O(n^{m+O(\sqrt{k-m})})\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Jaromczyk, J., Kowaluk, M.: An efficient algorithm for the Euclidean two-center problem. In: Proceedings 10th ACM Symposium on Computational Geometry, pp. 303–311 (1994)
Eppstein, D.: Faster construction of planar two-centers. In: Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms, pp. 131–138 (1997)
Sharir, M.: A near-linear algorithm for the planar 2-center problem. Discret. Comput. Geom. 18, 125–134 (1997)
Chan, T.M.: More planar two-center algorithms. Comput. Geom. Theory Appl. 13, 189–198 (1999)
Hershberger, J.: A faster algorithm for the two-center decision problem. Inform. Process. Lett. 47, 23–29 (1993)
Hershberger, J., Suri, S.: Finding tailored partitions. J. Algorithms 12, 431–463 (1991)
Agarwal, P.K., Sharir, M., Welzl, E.: The discrete 2-center problem. Discret. Comput. Geom. 20, 287–305 (2000)
Megiddo, N., Supowit, K.: On the complexity of some common geometric location problems. SIAM J. Comput. 13, 1182–1196 (1984)
Drezener, Z.: The p-center problem-heuristics and optimal algorithms. J. Oper. Res. Soc. 35, 741–748 (1984)
Megiddo, N.: Linear-time algorithms for the linear programming in \(R^3\) and related problems. SIAM J. Comput. 12, 759–776 (1983)
Hwang, R.Z., Lee, R.C.T., Chang, R.C.: The slab dividing approach to solve the Euclidean p-center problem. Algorithmica 9, 1–22 (1993)
Hochbaum, D.S., Shmoys, D.B.: A best possible heuristic for the k-center problem. Math. Oper. Res. 10(2), 180–184 (1985)
Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 293–306 (1985)
Feder, T., Greene, D.: Optimal algorithms for approximate clustering. In: Proceedings of the 20th ACM Symposium on Theory of Computing, pp. 434–444 (1988)
Nagarajan, V., Schieber, B., Shachnai, H.: The Euclidean k-supplier problem. In: Goemans, M., Correa, J. (eds.) IPCO 2013. LNCS, vol. 7801, pp. 290–301. Springer, Heidelberg (2013)
Aurenhammer, F., Klein, R., Lee, D.T.: Voronoi Diagrams and Delaunay Triangulations. World Scientific Publishing Company, Singapore (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Xu, Y., Peng, J., Xu, Y. (2016). The Mixed Center Location Problem. 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_25
Download citation
DOI: https://doi.org/10.1007/978-3-319-48749-6_25
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)