Author:
Dumitrescu Adrian,Ghosh Anirban,Tóth Csaba D.
Publisher
Springer International Publishing
Reference28 articles.
1. Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: The online set cover problem. SIAM J. Comput. 39(2), 361–370 (2009)
2. Biniaz, A., Liu, P., Maheshwari, A., Smid, M.H.M.: Approximation algorithms for the unit disk cover problem in 2D and 3D. Comput. Geom. 60, 8–18 (2017)
3. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
4. Boyvalenkov, P., Dodunekov, S., Musin, O.R.: A survey on the kissing numbers. Serdica Math. J. 38, 507–522 (2012)
5. Brass, P., Moser, W.O.J., Pach, J.: Research Problems in Discrete Geometry. Springer, New York (2005). https://doi.org/10.1007/0-387-29929-7
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Geometric Cover with Outliers Removal;LEIBNIZ INT PR INFOR;2021
2. Efficient Communication in Large Multi-robot Networks;2020 IEEE International Conference on Robotics and Automation (ICRA);2020-05
3. Unit Disk Cover for Massive Point Sets;Lecture Notes in Computer Science;2019