Author:
Wang Yin,Xu Yi,Xu Yinfeng,Zhang Huili
Publisher
Springer Nature Switzerland
Reference23 articles.
1. Lecture Notes in Computer Science;M Abellanas,2001
2. Abellanas, M., et al.: The farthest color voronoi diagram and related problems. In: European Workshop on Computational Geometry, pp. 113–116 (2006)
3. 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)
4. Banerjee, S., Misra, N., Nandy, S.C.: Color spanning objects: algorithms and hardness results. Disc. Appl. Math. 280, 14–22 (2020)
5. 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)