Abstract
Inspired by the applications in cloud manufacturing, we introduce a new 2-mixed-center version of the minimum color spanning problem, the first mixed-center model for color spanning problems to the best of our knowledge. Given a set P of n colored points on a plane, with each color chosen from a set C of \(m \le n\) colors, a 2-mixed-center color spanning problem determines the locations and radii of two disks to make the union of two disks contains at least one point of each color. Here, one center is called a discrete center, which is selected from P, while the other center is called a continuous center, which is selected from a plane. The objective is to minimize the maximum of three terms, i.e. the radii of the two disks and the distance between the two centers. We develop an exact algorithm to find the optimal solution in time complexity of \(O(n^7,n^5 m^3\log n)\). Furthermore, we propose a 2-approximation algorithm that reduces the time complexity to \(O(nm\log n)\).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abellanas, M., et al.: Smallest color-spanning objects. In: auf der Heide, F.M. (ed.) ESA 2001. LNCS, vol. 2161, pp. 278–289. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-44676-1_23
Abellanas, M., et al.: The farthest color voronoi diagram and related problems. In: European Workshop on Computational Geometry, pp. 113–116 (2006)
Agarwal, P.K., Sharir, M., Welzl, E.: The discrete 2-center problem. In: Proceedings of the Thirteenth Annual Symposium on Computational Geometry, pp. 147–155 (1997)
Banerjee, S., Misra, N., Nandy, S.C.: Color spanning objects: algorithms and hardness results. Disc. Appl. Math. 280, 14–22 (2020)
Bereg, S., Ma, F., Wang, W., Zhang, J., Zhu, B.: On some matching problems under the color-spanning model. Theor. Comput. Sci. 786, 26–31 (2019)
Chen, D., Chen, R.: New relaxation-based algorithms for the optimal solution of the continuous and discrete p-center problems. Comput. Oper. Res. 36(5), 1646–1655 (2009)
Das, S., Goswami, P.P., Nandy, S.C.: Smallest color-spanning object revisited. Int. J. Comput. Geom. Appl. 19(05), 457–478 (2009)
Fleischer, R., Xu, X.: Computing minimum diameter color-spanning sets. In: International Workshop on Frontiers in Algorithmics, pp. 285–292 (2010)
Fleischer, R., Xu, X.: Computing minimum diameter color-spanning sets is hard. Inf. Process. Lett. 111(21–22), 1054–1056 (2011)
Fortune, S.: A sweepline algorithm for voronoi diagrams. In: Proceedings of the Second Annual Symposium on Computational Geometry, pp. 313–322 (1986)
Hershberger, J.: A faster algorithm for the two-center decision problem. Inf. Process. Lett. 47(1), 23–29 (1993)
Ju, W., Fan, C., Luo, J., Zhu, B., Daescu, O.: On some geometric problems of color-spanning sets. J. Comb. Optim. 26(2), 266–283 (2013)
Kazemi, M.R., Mohades, A., Khanteimouri, P.: Approximation algorithms for color spanning diameter. Inf. Process. Lett. 135, 53–56 (2018)
Khanteimouri, P., Mohades, A., Abam, M.A., Kazemi, M.R.: Computing the smallest color-spanning axis-parallel square. In: International Symposium on Algorithms and Computation, pp. 634–643 (2013)
Li, C., Fan, C., Luo, J., Zhong, F., Zhu, B.: Expected computations on color spanning sets. J. Comb. Optim. 29(3), 589–604 (2015)
Mantas, I., Papadopoulou, E., Sacristán, V., Silveira, R.I.: Farthest color Voronoi diagrams: complexity and algorithms. In: Latin American Symposium on Theoretical Informatics, pp. 283–295 (2021)
Megiddo, N.: Linear-time algorithms for linear programming in r\(^{\hat{\,\,}}\)3 and related problems. SIAM J. Comput. 12(4), 759–776 (1983)
Sharir, M.: A near-linear algorithm for the planar 2-center problem. In: Proceedings of the Twelfth Annual Symposium on Computational Geometry, pp. 106–112 (1996)
Wang, H.: On the planar two-center problem and circular hulls. Disc. Comput. Geom. 68, 1–52 (2022)
Wang, Y., Xu, Y., Zhang, H., Tong, W.: Online k-color spanning disk problems (2023)
Xu, Y., Peng, J., Xu, Y.: The mixed center location problem. J. Comb. Optim. 36, 1128–1144 (2018)
Xu, Y., Peng, J., Xu, Y., Zhu, B.: The discrete and mixed minimax 2-center problem. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 101–109. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-26626-8_8
Zhang, D., Chee, Y.M., Mondal, A., Tung, A.K., Kitsuregawa, M.: Keyword search in spatial databases: towards searching by document. In: IEEE 25th International Conference on Data Engineering, pp. 688–699 (2009)
Acknowledgements
YW and YX are supported by the National Natural Science Foundation of China (NSFC) (Grant No. 71832001). YX is partially supported by the National Natural Science Foundation of China (NSFC) (No.72301209). HZ is partially supported by the National Natural Science Foundation of China (NSFC) ( No. 72071157, No. 72192834).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Wang, Y., Xu, Y., Xu, Y., Zhang, H. (2024). The 2-Mixed-Center Color Spanning Problem. In: Wu, W., Guo, J. (eds) Combinatorial Optimization and Applications. COCOA 2023. Lecture Notes in Computer Science, vol 14462. Springer, Cham. https://doi.org/10.1007/978-3-031-49614-1_16
Download citation
DOI: https://doi.org/10.1007/978-3-031-49614-1_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-49613-4
Online ISBN: 978-3-031-49614-1
eBook Packages: Computer ScienceComputer Science (R0)